./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.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/loop-lit/gj2007.c.i.p+lhb-reducer.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 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 --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 18:03:37,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:03:37,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:03:37,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:03:37,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:03:37,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:03:37,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:03:37,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:03:37,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:03:37,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:03:37,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:03:37,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:03:37,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:03:37,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:03:37,533 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:03:37,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:03:37,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:03:37,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:03:37,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:03:37,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:03:37,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:03:37,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:03:37,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:03:37,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:03:37,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:03:37,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:03:37,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:03:37,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:03:37,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:03:37,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:03:37,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:03:37,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:03:37,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:03:37,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:03:37,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:03:37,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:03:37,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:03:37,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:03:37,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:03:37,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:03:37,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:03:37,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:03:37,548 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 -> 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 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 18:03:37,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:03:37,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:03:37,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:03:37,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:03:37,893 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:03:37,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-12 18:03:39,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:03:39,769 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:03:39,773 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-12 18:03:39,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1c148c9db/0110ddf86b2f4f389a8bf60e0fb48d48/FLAGc57537da9 [2024-09-12 18:03:39,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1c148c9db/0110ddf86b2f4f389a8bf60e0fb48d48 [2024-09-12 18:03:39,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:03:39,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:03:39,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:03:39,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:03:39,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:03:39,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:03:39" (1/1) ... [2024-09-12 18:03:39,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5dbd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:39, skipping insertion in model container [2024-09-12 18:03:39,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:03:39" (1/1) ... [2024-09-12 18:03:39,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:03:40,054 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/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-12 18:03:40,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:03:40,084 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:03:40,110 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/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-12 18:03:40,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:03:40,158 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:03:40,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40 WrapperNode [2024-09-12 18:03:40,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:03:40,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:03:40,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:03:40,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:03:40,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,192 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:03:40,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:03:40,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:03:40,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:03:40,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:03:40,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 18:03:40,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:03:40,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:03:40,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:03:40,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:03:40,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (1/1) ... [2024-09-12 18:03:40,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:03:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:40,293 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 18:03:40,300 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 18:03:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:03:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:03:40,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:03:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:03:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:03:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:03:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:03:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:03:40,415 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:03:40,418 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:03:40,805 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-09-12 18:03:40,806 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:03:40,851 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:03:40,852 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 18:03:40,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:40 BoogieIcfgContainer [2024-09-12 18:03:40,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:03:40,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:03:40,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:03:40,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:03:40,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:03:39" (1/3) ... [2024-09-12 18:03:40,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5310e48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:03:40, skipping insertion in model container [2024-09-12 18:03:40,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:40" (2/3) ... [2024-09-12 18:03:40,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5310e48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:03:40, skipping insertion in model container [2024-09-12 18:03:40,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:40" (3/3) ... [2024-09-12 18:03:40,866 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2024-09-12 18:03:40,893 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:03:40,893 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-09-12 18:03:40,967 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:03:40,975 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;@1fcf64e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:03:40,976 INFO L337 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-09-12 18:03:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 86 states have (on average 1.9534883720930232) internal successors, (168), 147 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:03:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 18:03:40,988 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:40,988 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:40,989 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:40,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1411740522, now seen corresponding path program 1 times [2024-09-12 18:03:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998088443] [2024-09-12 18:03:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:41,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:41,247 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 18:03:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998088443] [2024-09-12 18:03:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998088443] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784651312] [2024-09-12 18:03:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:41,260 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:41,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:41,289 INFO L87 Difference]: Start difference. First operand has 152 states, 86 states have (on average 1.9534883720930232) internal successors, (168), 147 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 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 18:03:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:41,806 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2024-09-12 18:03:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 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 18:03:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:41,820 INFO L225 Difference]: With dead ends: 287 [2024-09-12 18:03:41,821 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 18:03:41,825 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:03:41,831 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:41,834 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 11 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 18:03:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 18:03:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-12 18:03:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.8) internal successors, (144), 134 states have internal predecessors, (144), 2 states have call successors, (2), 2 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 18:03:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2024-09-12 18:03:41,906 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 8 [2024-09-12 18:03:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:41,910 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2024-09-12 18:03:41,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 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 18:03:41,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2024-09-12 18:03:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:03:41,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:41,912 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:41,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:03:41,913 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:41,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 337574192, now seen corresponding path program 1 times [2024-09-12 18:03:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355781820] [2024-09-12 18:03:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,015 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 18:03:42,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355781820] [2024-09-12 18:03:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355781820] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:03:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891389130] [2024-09-12 18:03:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:42,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:42,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:03:42,022 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:42,364 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2024-09-12 18:03:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:42,367 INFO L225 Difference]: With dead ends: 253 [2024-09-12 18:03:42,367 INFO L226 Difference]: Without dead ends: 129 [2024-09-12 18:03:42,368 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:42,369 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:42,370 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 10 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:03:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-12 18:03:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-09-12 18:03:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.763157894736842) internal successors, (134), 125 states have internal predecessors, (134), 2 states have call successors, (2), 2 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 18:03:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2024-09-12 18:03:42,402 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 12 [2024-09-12 18:03:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:42,403 INFO L474 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2024-09-12 18:03:42,403 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2024-09-12 18:03:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:03:42,404 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:42,404 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:42,404 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:03:42,405 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:42,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash 337568144, now seen corresponding path program 1 times [2024-09-12 18:03:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4102733] [2024-09-12 18:03:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,477 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 18:03:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:42,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4102733] [2024-09-12 18:03:42,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4102733] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:42,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:42,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:03:42,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982248074] [2024-09-12 18:03:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:42,496 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:03:42,497 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:42,833 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2024-09-12 18:03:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:42,836 INFO L225 Difference]: With dead ends: 129 [2024-09-12 18:03:42,836 INFO L226 Difference]: Without dead ends: 112 [2024-09-12 18:03:42,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:42,838 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:42,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 10 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:03:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-12 18:03:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-09-12 18:03:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 108 states have internal predecessors, (117), 2 states have call successors, (2), 2 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 18:03:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-09-12 18:03:42,859 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 12 [2024-09-12 18:03:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:42,860 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-09-12 18:03:42,860 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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 18:03:42,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-09-12 18:03:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 18:03:42,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:42,861 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 18:03:42,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:03:42,862 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:42,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1175390323, now seen corresponding path program 1 times [2024-09-12 18:03:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:42,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802183376] [2024-09-12 18:03:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:42,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:42,909 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 18:03:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802183376] [2024-09-12 18:03:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802183376] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653461210] [2024-09-12 18:03:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:42,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:42,913 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 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 18:03:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:43,102 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-09-12 18:03:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 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 17 [2024-09-12 18:03:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:43,104 INFO L225 Difference]: With dead ends: 112 [2024-09-12 18:03:43,104 INFO L226 Difference]: Without dead ends: 96 [2024-09-12 18:03:43,104 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 18:03:43,108 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:43,109 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 7 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-12 18:03:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-09-12 18:03:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 2 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 18:03:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-09-12 18:03:43,131 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 17 [2024-09-12 18:03:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:43,131 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-09-12 18:03:43,131 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 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 18:03:43,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-09-12 18:03:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:03:43,133 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:43,133 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:43,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 18:03:43,134 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:43,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2072220648, now seen corresponding path program 1 times [2024-09-12 18:03:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:43,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091908613] [2024-09-12 18:03:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,197 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 18:03:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091908613] [2024-09-12 18:03:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091908613] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505983213] [2024-09-12 18:03:43,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:43,199 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:43,200 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 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 18:03:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:43,357 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-09-12 18:03:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 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 18 [2024-09-12 18:03:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:43,359 INFO L225 Difference]: With dead ends: 96 [2024-09-12 18:03:43,360 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 18:03:43,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:03:43,361 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:43,362 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 7 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 18:03:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-12 18:03:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 2 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 18:03:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-09-12 18:03:43,381 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 18 [2024-09-12 18:03:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:43,382 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-09-12 18:03:43,382 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 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 18:03:43,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-09-12 18:03:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:03:43,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:43,383 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 18:03:43,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:03:43,385 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:43,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash 185669590, now seen corresponding path program 1 times [2024-09-12 18:03:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698445411] [2024-09-12 18:03:43,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:43,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,470 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 18:03:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698445411] [2024-09-12 18:03:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698445411] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:43,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977560601] [2024-09-12 18:03:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:43,473 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:43,477 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 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 18:03:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:43,684 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2024-09-12 18:03:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 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 18:03:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:43,687 INFO L225 Difference]: With dead ends: 151 [2024-09-12 18:03:43,687 INFO L226 Difference]: Without dead ends: 143 [2024-09-12 18:03:43,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:03:43,688 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 214 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:43,688 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 7 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-12 18:03:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-09-12 18:03:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 139 states have internal predecessors, (156), 2 states have call successors, (2), 2 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 18:03:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2024-09-12 18:03:43,720 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 19 [2024-09-12 18:03:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:43,721 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2024-09-12 18:03:43,721 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 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 18:03:43,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2024-09-12 18:03:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 18:03:43,722 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:43,723 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] [2024-09-12 18:03:43,723 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 18:03:43,723 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:43,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 666330638, now seen corresponding path program 1 times [2024-09-12 18:03:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45456605] [2024-09-12 18:03:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:43,798 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 18:03:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45456605] [2024-09-12 18:03:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45456605] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:03:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531402465] [2024-09-12 18:03:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:43,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:03:43,801 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 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 18:03:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:44,111 INFO L93 Difference]: Finished difference Result 197 states and 220 transitions. [2024-09-12 18:03:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 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 18:03:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:44,113 INFO L225 Difference]: With dead ends: 197 [2024-09-12 18:03:44,113 INFO L226 Difference]: Without dead ends: 190 [2024-09-12 18:03:44,114 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:44,114 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 373 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:44,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 7 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-09-12 18:03:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-09-12 18:03:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 180 states have (on average 1.1666666666666667) internal successors, (210), 186 states have internal predecessors, (210), 2 states have call successors, (2), 2 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 18:03:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2024-09-12 18:03:44,156 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 25 [2024-09-12 18:03:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:44,156 INFO L474 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2024-09-12 18:03:44,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 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 18:03:44,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2024-09-12 18:03:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 18:03:44,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:44,163 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] [2024-09-12 18:03:44,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:03:44,164 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:44,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2053983184, now seen corresponding path program 1 times [2024-09-12 18:03:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229144932] [2024-09-12 18:03:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:44,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:44,263 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 18:03:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229144932] [2024-09-12 18:03:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229144932] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:03:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094828554] [2024-09-12 18:03:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:44,267 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:03:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:03:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:03:44,269 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 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 18:03:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:44,623 INFO L93 Difference]: Finished difference Result 235 states and 264 transitions. [2024-09-12 18:03:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:03:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 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 31 [2024-09-12 18:03:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:44,625 INFO L225 Difference]: With dead ends: 235 [2024-09-12 18:03:44,625 INFO L226 Difference]: Without dead ends: 229 [2024-09-12 18:03:44,626 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:03:44,626 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 502 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:44,627 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 7 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:03:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-09-12 18:03:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-09-12 18:03:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 220 states have (on average 1.1590909090909092) internal successors, (255), 225 states have internal predecessors, (255), 2 states have call successors, (2), 2 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 18:03:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2024-09-12 18:03:44,653 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 31 [2024-09-12 18:03:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:44,654 INFO L474 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2024-09-12 18:03:44,654 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 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 18:03:44,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2024-09-12 18:03:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 18:03:44,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:44,656 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, 1, 1, 1, 1] [2024-09-12 18:03:44,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 18:03:44,657 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:44,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1291942300, now seen corresponding path program 1 times [2024-09-12 18:03:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122036452] [2024-09-12 18:03:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:44,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:44,738 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 18:03:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122036452] [2024-09-12 18:03:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122036452] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 18:03:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481150354] [2024-09-12 18:03:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:44,740 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:03:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:03:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:03:44,752 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 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 18:03:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:44,919 INFO L93 Difference]: Finished difference Result 356 states and 402 transitions. [2024-09-12 18:03:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:03:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 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 37 [2024-09-12 18:03:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:44,921 INFO L225 Difference]: With dead ends: 356 [2024-09-12 18:03:44,921 INFO L226 Difference]: Without dead ends: 200 [2024-09-12 18:03:44,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:03:44,923 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:44,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 7 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-09-12 18:03:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-09-12 18:03:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.15625) internal successors, (222), 196 states have internal predecessors, (222), 2 states have call successors, (2), 2 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 18:03:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2024-09-12 18:03:44,943 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 37 [2024-09-12 18:03:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:44,944 INFO L474 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2024-09-12 18:03:44,944 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 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 18:03:44,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2024-09-12 18:03:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 18:03:44,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:44,946 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:44,946 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 18:03:44,946 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:44,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -434754903, now seen corresponding path program 1 times [2024-09-12 18:03:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204549717] [2024-09-12 18:03:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,028 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 18:03:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204549717] [2024-09-12 18:03:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204549717] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:03:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129141924] [2024-09-12 18:03:45,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:45,030 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:03:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:45,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:03:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:45,031 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 2 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 18:03:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:45,236 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2024-09-12 18:03:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:03:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 2 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 41 [2024-09-12 18:03:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:45,239 INFO L225 Difference]: With dead ends: 302 [2024-09-12 18:03:45,239 INFO L226 Difference]: Without dead ends: 171 [2024-09-12 18:03:45,240 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:03:45,241 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:45,241 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 10 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-09-12 18:03:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-09-12 18:03:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 164 states have (on average 1.1524390243902438) internal successors, (189), 167 states have internal predecessors, (189), 2 states have call successors, (2), 2 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 18:03:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2024-09-12 18:03:45,259 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 41 [2024-09-12 18:03:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:45,262 INFO L474 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2024-09-12 18:03:45,262 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 2 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 18:03:45,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2024-09-12 18:03:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 18:03:45,264 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:45,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:45,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 18:03:45,264 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:45,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash 924366676, now seen corresponding path program 1 times [2024-09-12 18:03:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:45,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215457497] [2024-09-12 18:03:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,332 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 18:03:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215457497] [2024-09-12 18:03:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215457497] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:45,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:03:45,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671839128] [2024-09-12 18:03:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:45,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:45,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:03:45,335 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (2), 2 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 18:03:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:45,501 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2024-09-12 18:03:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (2), 2 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 18:03:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:45,504 INFO L225 Difference]: With dead ends: 210 [2024-09-12 18:03:45,504 INFO L226 Difference]: Without dead ends: 207 [2024-09-12 18:03:45,504 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:45,505 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 134 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:45,505 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 10 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-09-12 18:03:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2024-09-12 18:03:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 170 states have internal predecessors, (191), 2 states have call successors, (2), 2 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 18:03:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2024-09-12 18:03:45,543 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 44 [2024-09-12 18:03:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:45,543 INFO L474 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2024-09-12 18:03:45,544 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (2), 2 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 18:03:45,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2024-09-12 18:03:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 18:03:45,546 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:45,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:45,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 18:03:45,546 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:45,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1896565750, now seen corresponding path program 1 times [2024-09-12 18:03:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:45,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111811060] [2024-09-12 18:03:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:45,669 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 18:03:45,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111811060] [2024-09-12 18:03:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111811060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 18:03:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233003828] [2024-09-12 18:03:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:45,671 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:03:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:45,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:03:45,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:03:45,672 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (2), 2 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 18:03:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:45,901 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2024-09-12 18:03:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:03:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (2), 2 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 45 [2024-09-12 18:03:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:45,904 INFO L225 Difference]: With dead ends: 253 [2024-09-12 18:03:45,904 INFO L226 Difference]: Without dead ends: 145 [2024-09-12 18:03:45,904 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:03:45,905 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:45,905 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 13 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-09-12 18:03:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-09-12 18:03:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 139 states have (on average 1.1366906474820144) internal successors, (158), 141 states have internal predecessors, (158), 2 states have call successors, (2), 2 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 18:03:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-09-12 18:03:45,921 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 45 [2024-09-12 18:03:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:45,921 INFO L474 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-09-12 18:03:45,921 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (2), 2 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 18:03:45,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-09-12 18:03:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 18:03:45,923 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:45,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:45,923 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 18:03:45,923 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:45,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2139206575, now seen corresponding path program 1 times [2024-09-12 18:03:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119677360] [2024-09-12 18:03:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,089 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 18:03:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119677360] [2024-09-12 18:03:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119677360] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-12 18:03:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458761292] [2024-09-12 18:03:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:46,090 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 18:03:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 18:03:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:03:46,091 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 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 18:03:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:46,284 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2024-09-12 18:03:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 18:03:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 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 46 [2024-09-12 18:03:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:46,289 INFO L225 Difference]: With dead ends: 176 [2024-09-12 18:03:46,290 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 18:03:46,290 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2024-09-12 18:03:46,291 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:46,291 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 16 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 18:03:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 18:03:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 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 18:03:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-09-12 18:03:46,301 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 46 [2024-09-12 18:03:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:46,301 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-09-12 18:03:46,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 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 18:03:46,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-09-12 18:03:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-12 18:03:46,303 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:46,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:46,303 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 18:03:46,303 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:46,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -202990746, now seen corresponding path program 1 times [2024-09-12 18:03:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159042326] [2024-09-12 18:03:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159042326] [2024-09-12 18:03:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159042326] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:46,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-12 18:03:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046398209] [2024-09-12 18:03:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:46,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:03:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:46,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:03:46,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:03:46,449 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 2 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 18:03:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:46,664 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-09-12 18:03:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 18:03:46,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 2 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 50 [2024-09-12 18:03:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:46,666 INFO L225 Difference]: With dead ends: 119 [2024-09-12 18:03:46,666 INFO L226 Difference]: Without dead ends: 84 [2024-09-12 18:03:46,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2024-09-12 18:03:46,667 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:46,668 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 13 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-12 18:03:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-09-12 18:03:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 2 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 18:03:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-09-12 18:03:46,678 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 50 [2024-09-12 18:03:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:46,678 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-09-12 18:03:46,678 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 2 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 18:03:46,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-09-12 18:03:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 18:03:46,680 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:46,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:46,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 18:03:46,680 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:46,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -292803487, now seen corresponding path program 1 times [2024-09-12 18:03:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951292650] [2024-09-12 18:03:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951292650] [2024-09-12 18:03:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951292650] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:46,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158934215] [2024-09-12 18:03:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:46,850 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 18:03:46,852 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 18:03:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:46,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 18:03:46,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:47,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158934215] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:47,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:47,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2024-09-12 18:03:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201145146] [2024-09-12 18:03:47,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:47,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 18:03:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 18:03:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2024-09-12 18:03:47,317 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 states have internal predecessors, (100), 1 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 18:03:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:47,846 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2024-09-12 18:03:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 18:03:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 states have internal predecessors, (100), 1 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 54 [2024-09-12 18:03:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:47,848 INFO L225 Difference]: With dead ends: 165 [2024-09-12 18:03:47,848 INFO L226 Difference]: Without dead ends: 130 [2024-09-12 18:03:47,850 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 18:03:47,852 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:47,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 22 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-12 18:03:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-09-12 18:03:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.064) internal successors, (133), 126 states have internal predecessors, (133), 2 states have call successors, (2), 2 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 18:03:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2024-09-12 18:03:47,869 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 54 [2024-09-12 18:03:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:47,870 INFO L474 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2024-09-12 18:03:47,870 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 states have internal predecessors, (100), 1 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 18:03:47,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2024-09-12 18:03:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-12 18:03:47,872 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:47,872 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:47,892 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 18:03:48,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 18:03:48,077 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:48,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1617253595, now seen corresponding path program 2 times [2024-09-12 18:03:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206334981] [2024-09-12 18:03:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:48,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 14 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:48,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:48,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206334981] [2024-09-12 18:03:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206334981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:48,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238750229] [2024-09-12 18:03:48,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:03:48,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:48,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:48,670 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 18:03:48,671 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 18:03:48,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:03:48,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:03:48,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 18:03:48,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 14 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:48,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 14 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238750229] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:49,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2024-09-12 18:03:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385680685] [2024-09-12 18:03:49,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:49,670 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-12 18:03:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:49,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-12 18:03:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2024-09-12 18:03:49,673 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 50 states, 50 states have (on average 3.92) internal successors, (196), 49 states have internal predecessors, (196), 1 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 18:03:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:51,078 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2024-09-12 18:03:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-12 18:03:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.92) internal successors, (196), 49 states have internal predecessors, (196), 1 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 102 [2024-09-12 18:03:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:51,080 INFO L225 Difference]: With dead ends: 261 [2024-09-12 18:03:51,080 INFO L226 Difference]: Without dead ends: 226 [2024-09-12 18:03:51,083 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2024-09-12 18:03:51,084 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 257 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:51,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 25 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:03:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-12 18:03:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-09-12 18:03:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.0361990950226245) internal successors, (229), 222 states have internal predecessors, (229), 2 states have call successors, (2), 2 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 18:03:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 232 transitions. [2024-09-12 18:03:51,110 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 232 transitions. Word has length 102 [2024-09-12 18:03:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:51,110 INFO L474 AbstractCegarLoop]: Abstraction has 226 states and 232 transitions. [2024-09-12 18:03:51,111 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.92) internal successors, (196), 49 states have internal predecessors, (196), 1 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 18:03:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 232 transitions. [2024-09-12 18:03:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-09-12 18:03:51,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:51,113 INFO L216 NwaCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:51,128 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 18:03:51,317 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 18:03:51,318 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:51,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1488543917, now seen corresponding path program 3 times [2024-09-12 18:03:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109536815] [2024-09-12 18:03:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:52,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 38 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109536815] [2024-09-12 18:03:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109536815] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709191072] [2024-09-12 18:03:53,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:03:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:53,007 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 18:03:53,009 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 18:03:53,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 18:03:53,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:03:53,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:03:53,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 183 proven. 1 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2024-09-12 18:03:53,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 183 proven. 1 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2024-09-12 18:03:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709191072] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:53,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 5, 5] total 56 [2024-09-12 18:03:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389498965] [2024-09-12 18:03:53,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:53,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-12 18:03:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-12 18:03:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2024-09-12 18:03:53,337 INFO L87 Difference]: Start difference. First operand 226 states and 232 transitions. Second operand has 56 states, 56 states have (on average 4.589285714285714) internal successors, (257), 55 states have internal predecessors, (257), 1 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 18:03:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:54,793 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2024-09-12 18:03:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-12 18:03:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.589285714285714) internal successors, (257), 55 states have internal predecessors, (257), 1 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 198 [2024-09-12 18:03:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:54,795 INFO L225 Difference]: With dead ends: 313 [2024-09-12 18:03:54,795 INFO L226 Difference]: Without dead ends: 278 [2024-09-12 18:03:54,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2024-09-12 18:03:54,799 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 258 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:54,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 19 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-12 18:03:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2024-09-12 18:03:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.063197026022305) internal successors, (286), 270 states have internal predecessors, (286), 2 states have call successors, (2), 2 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 18:03:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 289 transitions. [2024-09-12 18:03:54,829 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 289 transitions. Word has length 198 [2024-09-12 18:03:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:54,829 INFO L474 AbstractCegarLoop]: Abstraction has 274 states and 289 transitions. [2024-09-12 18:03:54,829 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.589285714285714) internal successors, (257), 55 states have internal predecessors, (257), 1 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 18:03:54,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 289 transitions. [2024-09-12 18:03:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-09-12 18:03:54,832 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:54,832 INFO L216 NwaCegarLoop]: trace histogram [43, 39, 39, 39, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:54,850 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 18:03:55,033 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-12 18:03:55,033 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:55,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2091302790, now seen corresponding path program 1 times [2024-09-12 18:03:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230357349] [2024-09-12 18:03:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:56,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3312 backedges. 240 proven. 3042 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-12 18:03:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230357349] [2024-09-12 18:03:56,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230357349] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970596848] [2024-09-12 18:03:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:56,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:56,886 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 18:03:56,888 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 18:03:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:56,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-12 18:03:56,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3312 backedges. 240 proven. 3042 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-12 18:03:57,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3312 backedges. 240 proven. 3042 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-12 18:03:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970596848] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:58,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 54 [2024-09-12 18:03:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087576646] [2024-09-12 18:03:58,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:58,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 18:03:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 18:03:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 18:03:58,273 INFO L87 Difference]: Start difference. First operand 274 states and 289 transitions. Second operand has 54 states, 54 states have (on average 4.648148148148148) internal successors, (251), 53 states have internal predecessors, (251), 1 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 18:03:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:59,652 INFO L93 Difference]: Finished difference Result 357 states and 388 transitions. [2024-09-12 18:03:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-12 18:03:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.648148148148148) internal successors, (251), 53 states have internal predecessors, (251), 1 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 221 [2024-09-12 18:03:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:59,655 INFO L225 Difference]: With dead ends: 357 [2024-09-12 18:03:59,655 INFO L226 Difference]: Without dead ends: 282 [2024-09-12 18:03:59,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 394 SyntacticMatches, 48 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2024-09-12 18:03:59,659 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 214 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:59,660 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 16 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:03:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-09-12 18:03:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-09-12 18:03:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.0613718411552346) internal successors, (294), 278 states have internal predecessors, (294), 2 states have call successors, (2), 2 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 18:03:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 297 transitions. [2024-09-12 18:03:59,689 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 297 transitions. Word has length 221 [2024-09-12 18:03:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:59,690 INFO L474 AbstractCegarLoop]: Abstraction has 282 states and 297 transitions. [2024-09-12 18:03:59,690 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.648148148148148) internal successors, (251), 53 states have internal predecessors, (251), 1 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 18:03:59,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 297 transitions. [2024-09-12 18:03:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-09-12 18:03:59,693 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:59,693 INFO L216 NwaCegarLoop]: trace histogram [45, 41, 41, 41, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:59,715 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 18:03:59,894 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-12 18:03:59,895 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:03:59,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2034170544, now seen corresponding path program 2 times [2024-09-12 18:03:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381240610] [2024-09-12 18:03:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:00,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381240610] [2024-09-12 18:04:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381240610] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602225824] [2024-09-12 18:04:00,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:04:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:00,042 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 18:04:00,044 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 18:04:00,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:04:00,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:00,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:04:00,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:00,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602225824] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:00,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-09-12 18:04:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851416154] [2024-09-12 18:04:00,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:00,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:04:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:04:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:04:00,581 INFO L87 Difference]: Start difference. First operand 282 states and 297 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 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 18:04:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:00,780 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2024-09-12 18:04:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:04:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 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 229 [2024-09-12 18:04:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:00,783 INFO L225 Difference]: With dead ends: 440 [2024-09-12 18:04:00,783 INFO L226 Difference]: Without dead ends: 439 [2024-09-12 18:04:00,784 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2024-09-12 18:04:00,784 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 149 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:00,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 13 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:04:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-09-12 18:04:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-09-12 18:04:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.1013824884792627) internal successors, (478), 435 states have internal predecessors, (478), 2 states have call successors, (2), 2 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 18:04:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 481 transitions. [2024-09-12 18:04:00,824 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 481 transitions. Word has length 229 [2024-09-12 18:04:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:00,824 INFO L474 AbstractCegarLoop]: Abstraction has 439 states and 481 transitions. [2024-09-12 18:04:00,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 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 18:04:00,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 481 transitions. [2024-09-12 18:04:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-09-12 18:04:00,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:00,830 INFO L216 NwaCegarLoop]: trace histogram [46, 41, 41, 41, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:00,849 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 18:04:01,031 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:01,032 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:01,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 466961889, now seen corresponding path program 4 times [2024-09-12 18:04:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772147118] [2024-09-12 18:04:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:03,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3796 backedges. 0 proven. 3796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:04:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772147118] [2024-09-12 18:04:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772147118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071126136] [2024-09-12 18:04:03,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 18:04:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:03,014 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 18:04:03,016 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 18:04:03,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 18:04:03,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:03,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-12 18:04:03,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3796 backedges. 0 proven. 3796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:04:03,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3796 backedges. 0 proven. 3796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:04:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071126136] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:06,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 104 [2024-09-12 18:04:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993832845] [2024-09-12 18:04:06,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:06,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-09-12 18:04:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-09-12 18:04:06,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2024-09-12 18:04:06,222 INFO L87 Difference]: Start difference. First operand 439 states and 481 transitions. Second operand has 104 states, 104 states have (on average 4.528846153846154) internal successors, (471), 103 states have internal predecessors, (471), 1 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 18:04:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:10,862 INFO L93 Difference]: Finished difference Result 794 states and 930 transitions. [2024-09-12 18:04:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-09-12 18:04:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.528846153846154) internal successors, (471), 103 states have internal predecessors, (471), 1 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 238 [2024-09-12 18:04:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:10,868 INFO L225 Difference]: With dead ends: 794 [2024-09-12 18:04:10,868 INFO L226 Difference]: Without dead ends: 791 [2024-09-12 18:04:10,873 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 421 SyntacticMatches, 12 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6820 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2024-09-12 18:04:10,873 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1251 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:10,874 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 16 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 18:04:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-09-12 18:04:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 742. [2024-09-12 18:04:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 737 states have (on average 1.185888738127544) internal successors, (874), 738 states have internal predecessors, (874), 2 states have call successors, (2), 2 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 18:04:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 877 transitions. [2024-09-12 18:04:10,956 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 877 transitions. Word has length 238 [2024-09-12 18:04:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:10,957 INFO L474 AbstractCegarLoop]: Abstraction has 742 states and 877 transitions. [2024-09-12 18:04:10,958 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.528846153846154) internal successors, (471), 103 states have internal predecessors, (471), 1 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 18:04:10,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 877 transitions. [2024-09-12 18:04:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-09-12 18:04:10,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:10,962 INFO L216 NwaCegarLoop]: trace histogram [50, 41, 41, 41, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:10,983 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 18:04:11,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:11,163 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -247601290, now seen corresponding path program 3 times [2024-09-12 18:04:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180860497] [2024-09-12 18:04:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:11,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180860497] [2024-09-12 18:04:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180860497] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546863233] [2024-09-12 18:04:11,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:04:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:11,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:11,425 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 18:04:11,427 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 18:04:11,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-12 18:04:11,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:11,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 18:04:11,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:11,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546863233] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:12,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2024-09-12 18:04:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955039573] [2024-09-12 18:04:12,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:12,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 18:04:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 18:04:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2024-09-12 18:04:12,011 INFO L87 Difference]: Start difference. First operand 742 states and 877 transitions. Second operand has 21 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 1 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 18:04:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:12,531 INFO L93 Difference]: Finished difference Result 1573 states and 1977 transitions. [2024-09-12 18:04:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 18:04:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 1 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 259 [2024-09-12 18:04:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:12,539 INFO L225 Difference]: With dead ends: 1573 [2024-09-12 18:04:12,539 INFO L226 Difference]: Without dead ends: 1572 [2024-09-12 18:04:12,540 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2024-09-12 18:04:12,541 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 302 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:12,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 13 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:04:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-09-12 18:04:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2024-09-12 18:04:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1567 states have (on average 1.173580089342693) internal successors, (1839), 1568 states have internal predecessors, (1839), 2 states have call successors, (2), 2 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 18:04:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1842 transitions. [2024-09-12 18:04:12,695 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1842 transitions. Word has length 259 [2024-09-12 18:04:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:12,696 INFO L474 AbstractCegarLoop]: Abstraction has 1572 states and 1842 transitions. [2024-09-12 18:04:12,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 1 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 18:04:12,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1842 transitions. [2024-09-12 18:04:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-09-12 18:04:12,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:12,701 INFO L216 NwaCegarLoop]: trace histogram [60, 41, 41, 41, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:12,718 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 18:04:12,901 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:12,902 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:12,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 599046210, now seen corresponding path program 4 times [2024-09-12 18:04:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757722022] [2024-09-12 18:04:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:13,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757722022] [2024-09-12 18:04:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757722022] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727092250] [2024-09-12 18:04:13,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 18:04:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:13,433 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 18:04:13,433 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 18:04:13,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 18:04:13,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:13,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 18:04:13,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:13,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727092250] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:14,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:14,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2024-09-12 18:04:14,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222079713] [2024-09-12 18:04:14,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:14,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-12 18:04:14,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-12 18:04:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 18:04:14,437 INFO L87 Difference]: Start difference. First operand 1572 states and 1842 transitions. Second operand has 41 states, 40 states have (on average 7.75) internal successors, (310), 40 states have internal predecessors, (310), 1 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 18:04:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:15,805 INFO L93 Difference]: Finished difference Result 5033 states and 6442 transitions. [2024-09-12 18:04:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-12 18:04:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.75) internal successors, (310), 40 states have internal predecessors, (310), 1 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 319 [2024-09-12 18:04:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:15,829 INFO L225 Difference]: With dead ends: 5033 [2024-09-12 18:04:15,829 INFO L226 Difference]: Without dead ends: 5032 [2024-09-12 18:04:15,833 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2024-09-12 18:04:15,833 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 698 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:15,834 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 13 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:04:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2024-09-12 18:04:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 5032. [2024-09-12 18:04:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5032 states, 5027 states have (on average 1.1674955241694849) internal successors, (5869), 5028 states have internal predecessors, (5869), 2 states have call successors, (2), 2 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 18:04:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 5872 transitions. [2024-09-12 18:04:16,397 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 5872 transitions. Word has length 319 [2024-09-12 18:04:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:16,398 INFO L474 AbstractCegarLoop]: Abstraction has 5032 states and 5872 transitions. [2024-09-12 18:04:16,399 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.75) internal successors, (310), 40 states have internal predecessors, (310), 1 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 18:04:16,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 5872 transitions. [2024-09-12 18:04:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-09-12 18:04:16,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:16,412 INFO L216 NwaCegarLoop]: trace histogram [80, 41, 41, 41, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:16,427 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 18:04:16,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:16,613 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:16,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 297864154, now seen corresponding path program 5 times [2024-09-12 18:04:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245142274] [2024-09-12 18:04:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:18,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245142274] [2024-09-12 18:04:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245142274] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878232916] [2024-09-12 18:04:18,139 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 18:04:18,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:18,141 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 18:04:18,144 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 18:04:18,297 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2024-09-12 18:04:18,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:18,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-12 18:04:18,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:18,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878232916] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:20,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2024-09-12 18:04:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997392924] [2024-09-12 18:04:20,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:20,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-09-12 18:04:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-09-12 18:04:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2024-09-12 18:04:20,617 INFO L87 Difference]: Start difference. First operand 5032 states and 5872 transitions. Second operand has 81 states, 80 states have (on average 6.875) internal successors, (550), 80 states have internal predecessors, (550), 1 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 18:04:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:25,118 INFO L93 Difference]: Finished difference Result 16745 states and 21480 transitions. [2024-09-12 18:04:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-09-12 18:04:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 6.875) internal successors, (550), 80 states have internal predecessors, (550), 1 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 439 [2024-09-12 18:04:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:25,179 INFO L225 Difference]: With dead ends: 16745 [2024-09-12 18:04:25,180 INFO L226 Difference]: Without dead ends: 16744 [2024-09-12 18:04:25,188 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3744 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2024-09-12 18:04:25,189 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1584 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:25,189 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 10 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 18:04:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2024-09-12 18:04:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16744. [2024-09-12 18:04:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16744 states, 16739 states have (on average 1.1675129936077424) internal successors, (19543), 16740 states have internal predecessors, (19543), 2 states have call successors, (2), 2 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 18:04:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16744 states to 16744 states and 19546 transitions. [2024-09-12 18:04:26,706 INFO L78 Accepts]: Start accepts. Automaton has 16744 states and 19546 transitions. Word has length 439 [2024-09-12 18:04:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:26,708 INFO L474 AbstractCegarLoop]: Abstraction has 16744 states and 19546 transitions. [2024-09-12 18:04:26,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 6.875) internal successors, (550), 80 states have internal predecessors, (550), 1 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 18:04:26,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16744 states and 19546 transitions. [2024-09-12 18:04:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2024-09-12 18:04:26,730 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:26,730 INFO L216 NwaCegarLoop]: trace histogram [91, 50, 50, 50, 50, 50, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:26,749 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-12 18:04:26,930 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-12 18:04:26,931 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:26,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1961876811, now seen corresponding path program 5 times [2024-09-12 18:04:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57618335] [2024-09-12 18:04:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:29,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14821 backedges. 0 proven. 11459 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57618335] [2024-09-12 18:04:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57618335] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:04:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017153904] [2024-09-12 18:04:29,961 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 18:04:29,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:04:29,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:04:29,968 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 18:04:29,974 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 18:04:30,158 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2024-09-12 18:04:30,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:04:30,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-09-12 18:04:30,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:04:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14821 backedges. 0 proven. 11459 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:30,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:04:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14821 backedges. 0 proven. 11459 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017153904] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:04:31,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:04:31,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2024-09-12 18:04:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673995082] [2024-09-12 18:04:31,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:04:31,409 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-12 18:04:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:31,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-12 18:04:31,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2024-09-12 18:04:31,411 INFO L87 Difference]: Start difference. First operand 16744 states and 19546 transitions. Second operand has 56 states, 56 states have (on average 6.196428571428571) internal successors, (347), 55 states have internal predecessors, (347), 1 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 18:04:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:40,566 INFO L93 Difference]: Finished difference Result 16747 states and 19548 transitions. [2024-09-12 18:04:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-12 18:04:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.196428571428571) internal successors, (347), 55 states have internal predecessors, (347), 1 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 508 [2024-09-12 18:04:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:40,649 INFO L225 Difference]: With dead ends: 16747 [2024-09-12 18:04:40,649 INFO L226 Difference]: Without dead ends: 16744 [2024-09-12 18:04:40,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 1016 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=11237, Unknown=0, NotChecked=0, Total=11556 [2024-09-12 18:04:40,664 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 665 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 26560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 26561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:40,665 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 163 Invalid, 26561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 26560 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-09-12 18:04:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2024-09-12 18:04:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16449. [2024-09-12 18:04:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16449 states, 16444 states have (on average 1.1674774993918755) internal successors, (19198), 16445 states have internal predecessors, (19198), 2 states have call successors, (2), 2 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 18:04:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16449 states to 16449 states and 19201 transitions. [2024-09-12 18:04:42,495 INFO L78 Accepts]: Start accepts. Automaton has 16449 states and 19201 transitions. Word has length 508 [2024-09-12 18:04:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:42,496 INFO L474 AbstractCegarLoop]: Abstraction has 16449 states and 19201 transitions. [2024-09-12 18:04:42,496 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.196428571428571) internal successors, (347), 55 states have internal predecessors, (347), 1 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 18:04:42,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 16449 states and 19201 transitions. [2024-09-12 18:04:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2024-09-12 18:04:42,516 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:04:42,516 INFO L216 NwaCegarLoop]: trace histogram [92, 51, 51, 51, 51, 51, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:42,535 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-12 18:04:42,716 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-12 18:04:42,718 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2024-09-12 18:04:42,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2060375011, now seen corresponding path program 6 times [2024-09-12 18:04:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:04:42,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398699047] [2024-09-12 18:04:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:04:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:04:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:45,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:04:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:04:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15204 backedges. 11842 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-09-12 18:04:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:04:45,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398699047] [2024-09-12 18:04:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398699047] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:04:45,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:04:45,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2024-09-12 18:04:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042304000] [2024-09-12 18:04:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:04:45,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 18:04:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:04:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 18:04:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 18:04:45,167 INFO L87 Difference]: Start difference. First operand 16449 states and 19201 transitions. Second operand has 54 states, 54 states have (on average 6.481481481481482) internal successors, (350), 53 states have internal predecessors, (350), 1 states have call successors, (2), 2 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 18:04:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:04:46,668 INFO L93 Difference]: Finished difference Result 16744 states and 19545 transitions. [2024-09-12 18:04:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-12 18:04:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.481481481481482) internal successors, (350), 53 states have internal predecessors, (350), 1 states have call successors, (2), 2 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 514 [2024-09-12 18:04:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:04:46,684 INFO L225 Difference]: With dead ends: 16744 [2024-09-12 18:04:46,684 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:04:46,717 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2024-09-12 18:04:46,718 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:04:46,718 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 10 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 18:04:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:04:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:04:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 18:04:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:04:46,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 514 [2024-09-12 18:04:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:04:46,730 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:04:46,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.481481481481482) internal successors, (350), 53 states have internal predecessors, (350), 1 states have call successors, (2), 2 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 18:04:46,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:04:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:04:46,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:04:46,734 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 61 remaining) [2024-09-12 18:04:46,734 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 61 remaining) [2024-09-12 18:04:46,734 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 61 remaining) [2024-09-12 18:04:46,734 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 61 remaining) [2024-09-12 18:04:46,734 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 61 remaining) [2024-09-12 18:04:46,735 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 61 remaining) [2024-09-12 18:04:46,736 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 61 remaining) [2024-09-12 18:04:46,737 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr24ASSERT_VIOLATIONERROR_FUNCTION (36 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 61 remaining) [2024-09-12 18:04:46,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 61 remaining) [2024-09-12 18:04:46,739 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 61 remaining) [2024-09-12 18:04:46,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 61 remaining) [2024-09-12 18:04:46,741 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 61 remaining) [2024-09-12 18:04:46,742 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 61 remaining) [2024-09-12 18:04:46,742 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 61 remaining) [2024-09-12 18:04:46,742 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 61 remaining) [2024-09-12 18:04:46,742 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 61 remaining) [2024-09-12 18:04:46,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-12 18:04:46,746 INFO L408 BasicCegarLoop]: Path program histogram: [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:04:46,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:04:52,265 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:04:52,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:04:52 BoogieIcfgContainer [2024-09-12 18:04:52,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:04:52,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:04:52,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:04:52,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:04:52,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:40" (3/4) ... [2024-09-12 18:04:52,302 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:04:52,305 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:04:52,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:04:52,315 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-12 18:04:52,315 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 18:04:52,315 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 18:04:52,316 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:04:52,337 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__x == 1) && (main__y == 50)) && (\old(__return_720) == __return_720)) [2024-09-12 18:04:52,337 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__y == 50) && (main__x <= 2)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) [2024-09-12 18:04:52,337 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (1 <= main__x)) && (main__x <= 3)) [2024-09-12 18:04:52,338 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__y == 50) && (main__x <= 4)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) [2024-09-12 18:04:52,338 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 5)) && (1 <= main__x)) [2024-09-12 18:04:52,338 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 6)) && (1 <= main__x)) [2024-09-12 18:04:52,338 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__x <= 7) && (main__y == 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) [2024-09-12 18:04:52,339 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((main__x <= 8) && (main__y == 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) [2024-09-12 18:04:52,339 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((89 == main__y) && (89 == main__x)) && (\old(__return_720) == __return_720)) || (((53 == main__y) && (53 == main__x)) && (\old(__return_720) == __return_720))) || (((71 == main__y) && (\old(__return_720) == __return_720)) && (71 == main__x))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_720) == __return_720))) || (((88 == main__y) && (\old(__return_720) == __return_720)) && (88 == main__x))) || (((81 == main__y) && (\old(__return_720) == __return_720)) && (81 == main__x))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_720) == __return_720))) || (((65 == main__y) && (\old(__return_720) == __return_720)) && (65 == main__x))) || (((52 == main__y) && (\old(__return_720) == __return_720)) && (52 == main__x))) || (((74 == main__x) && (\old(__return_720) == __return_720)) && (74 == main__y))) || (((64 == main__x) && (64 == main__y)) && (\old(__return_720) == __return_720))) || (((\old(__return_720) == __return_720) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_720) == __return_720) && (main__x == 80)) && (main__y == 80))) || (((main__y == 86) && (\old(__return_720) == __return_720)) && (main__x == 86))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_720) == __return_720))) || (((87 == main__x) && (\old(__return_720) == __return_720)) && (87 == main__y))) || (((90 == main__x) && (\old(__return_720) == __return_720)) && (90 == main__y))) || (((\old(__return_720) == __return_720) && (92 == main__y)) && (92 == main__x))) || (((60 == main__x) && (60 == main__y)) && (\old(__return_720) == __return_720))) || (((63 == main__x) && (63 == main__y)) && (\old(__return_720) == __return_720))) || ((((main__y == 50) && (main__x <= 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_720) == __return_720))) || (((59 == main__y) && (\old(__return_720) == __return_720)) && (59 == main__x))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_720) == __return_720))) || (((85 == main__y) && (\old(__return_720) == __return_720)) && (85 == main__x))) || (((73 == main__x) && (\old(__return_720) == __return_720)) && (73 == main__y))) || (((97 == main__x) && (\old(__return_720) == __return_720)) && (97 == main__y))) || (((main__x == 83) && (\old(__return_720) == __return_720)) && (main__y == 83))) || (((main__y == 54) && (main__x == 54)) && (\old(__return_720) == __return_720))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_720) == __return_720))) || (((main__x == 61) && (main__y == 61)) && (\old(__return_720) == __return_720))) || (((58 == main__y) && (\old(__return_720) == __return_720)) && (58 == main__x))) || (((69 == main__y) && (\old(__return_720) == __return_720)) && (69 == main__x))) || (((95 == main__y) && (\old(__return_720) == __return_720)) && (95 == main__x))) || (((56 == main__x) && (\old(__return_720) == __return_720)) && (56 == main__y))) || (((55 == main__x) && (\old(__return_720) == __return_720)) && (55 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_720) == __return_720))) || (((68 == main__x) && (\old(__return_720) == __return_720)) && (68 == main__y))) || (((\old(__return_720) == __return_720) && (57 == main__x)) && (57 == main__y))) || (((51 == main__y) && (51 == main__x)) && (\old(__return_720) == __return_720))) || (((66 == main__y) && (66 == main__x)) && (\old(__return_720) == __return_720))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_720) == __return_720))) || (((84 == main__x) && (\old(__return_720) == __return_720)) && (84 == main__y))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_720) == __return_720))) || (((62 == main__x) && (62 == main__y)) && (\old(__return_720) == __return_720))) || (((70 == main__x) && (\old(__return_720) == __return_720)) && (70 == main__y))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_720) == __return_720))) || (((76 == main__y) && (76 == main__x)) && (\old(__return_720) == __return_720))) || (((78 == main__y) && (\old(__return_720) == __return_720)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_720) == __return_720)) && (82 == main__y))) || (((\old(__return_720) == __return_720) && (77 == main__x)) && (77 == main__y))) [2024-09-12 18:04:52,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:04:52,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:04:52,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:04:52,431 INFO L158 Benchmark]: Toolchain (without parser) took 72619.28ms. Allocated memory was 81.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 53.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 588.8MB. Max. memory is 16.1GB. [2024-09-12 18:04:52,431 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:04:52,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.42ms. Allocated memory is still 81.8MB. Free memory was 53.6MB in the beginning and 62.3MB in the end (delta: -8.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-09-12 18:04:52,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.12ms. Allocated memory is still 81.8MB. Free memory was 62.0MB in the beginning and 61.0MB in the end (delta: 983.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:04:52,432 INFO L158 Benchmark]: Boogie Preprocessor took 54.59ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 59.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:04:52,432 INFO L158 Benchmark]: RCFGBuilder took 598.08ms. Allocated memory is still 81.8MB. Free memory was 59.3MB in the beginning and 37.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-12 18:04:52,432 INFO L158 Benchmark]: TraceAbstraction took 71440.42ms. Allocated memory was 81.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 36.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-09-12 18:04:52,432 INFO L158 Benchmark]: Witness Printer took 134.34ms. Allocated memory is still 2.6GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-12 18:04:52,435 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.42ms. Allocated memory is still 81.8MB. Free memory was 53.6MB in the beginning and 62.3MB in the end (delta: -8.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.12ms. Allocated memory is still 81.8MB. Free memory was 62.0MB in the beginning and 61.0MB in the end (delta: 983.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.59ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 59.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 598.08ms. Allocated memory is still 81.8MB. Free memory was 59.3MB in the beginning and 37.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 71440.42ms. Allocated memory was 81.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 36.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 134.34ms. Allocated memory is still 2.6GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 152 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 65.8s, OverallIterations: 25, TraceHistogramMax: 92, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7923 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7923 mSDsluCounter, 455 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34716 IncrementalHoareTripleChecker+Invalid, 35205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 77 mSDtfsCounter, 34716 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6238 GetRequests, 5023 SyntacticMatches, 61 SemanticMatches, 1154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20330 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16744occurred in iteration=23, InterpolantAutomatonStates: 637, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 383 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 6053 NumberOfCodeBlocks, 5781 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 8575 ConstructedInterpolants, 0 QuantifiedInterpolants, 23860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 45 InterpolantComputations, 15 PerfectInterpolantSequences, 72081/164386 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 61 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((main__y == 50) && (main__x <= 2)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (1 <= main__x)) && (main__x <= 3)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: ((((main__x <= 7) && (main__y == 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((main__x == 1) && (main__y == 50)) && (\old(__return_720) == __return_720)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((((main__x <= 8) && (main__y == 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 6)) && (1 <= main__x)) - InvariantResult [Line: 72]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((89 == main__y) && (89 == main__x)) && (\old(__return_720) == __return_720)) || (((53 == main__y) && (53 == main__x)) && (\old(__return_720) == __return_720))) || (((71 == main__y) && (\old(__return_720) == __return_720)) && (71 == main__x))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_720) == __return_720))) || (((88 == main__y) && (\old(__return_720) == __return_720)) && (88 == main__x))) || (((81 == main__y) && (\old(__return_720) == __return_720)) && (81 == main__x))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_720) == __return_720))) || (((65 == main__y) && (\old(__return_720) == __return_720)) && (65 == main__x))) || (((52 == main__y) && (\old(__return_720) == __return_720)) && (52 == main__x))) || (((74 == main__x) && (\old(__return_720) == __return_720)) && (74 == main__y))) || (((64 == main__x) && (64 == main__y)) && (\old(__return_720) == __return_720))) || (((\old(__return_720) == __return_720) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_720) == __return_720) && (main__x == 80)) && (main__y == 80))) || (((main__y == 86) && (\old(__return_720) == __return_720)) && (main__x == 86))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_720) == __return_720))) || (((87 == main__x) && (\old(__return_720) == __return_720)) && (87 == main__y))) || (((90 == main__x) && (\old(__return_720) == __return_720)) && (90 == main__y))) || (((\old(__return_720) == __return_720) && (92 == main__y)) && (92 == main__x))) || (((60 == main__x) && (60 == main__y)) && (\old(__return_720) == __return_720))) || (((63 == main__x) && (63 == main__y)) && (\old(__return_720) == __return_720))) || ((((main__y == 50) && (main__x <= 50)) && (\old(__return_720) == __return_720)) && (1 <= main__x))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_720) == __return_720))) || (((59 == main__y) && (\old(__return_720) == __return_720)) && (59 == main__x))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_720) == __return_720))) || (((85 == main__y) && (\old(__return_720) == __return_720)) && (85 == main__x))) || (((73 == main__x) && (\old(__return_720) == __return_720)) && (73 == main__y))) || (((97 == main__x) && (\old(__return_720) == __return_720)) && (97 == main__y))) || (((main__x == 83) && (\old(__return_720) == __return_720)) && (main__y == 83))) || (((main__y == 54) && (main__x == 54)) && (\old(__return_720) == __return_720))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_720) == __return_720))) || (((main__x == 61) && (main__y == 61)) && (\old(__return_720) == __return_720))) || (((58 == main__y) && (\old(__return_720) == __return_720)) && (58 == main__x))) || (((69 == main__y) && (\old(__return_720) == __return_720)) && (69 == main__x))) || (((95 == main__y) && (\old(__return_720) == __return_720)) && (95 == main__x))) || (((56 == main__x) && (\old(__return_720) == __return_720)) && (56 == main__y))) || (((55 == main__x) && (\old(__return_720) == __return_720)) && (55 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_720) == __return_720))) || (((68 == main__x) && (\old(__return_720) == __return_720)) && (68 == main__y))) || (((\old(__return_720) == __return_720) && (57 == main__x)) && (57 == main__y))) || (((51 == main__y) && (51 == main__x)) && (\old(__return_720) == __return_720))) || (((66 == main__y) && (66 == main__x)) && (\old(__return_720) == __return_720))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_720) == __return_720))) || (((84 == main__x) && (\old(__return_720) == __return_720)) && (84 == main__y))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_720) == __return_720))) || (((62 == main__x) && (62 == main__y)) && (\old(__return_720) == __return_720))) || (((70 == main__x) && (\old(__return_720) == __return_720)) && (70 == main__y))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_720) == __return_720))) || (((76 == main__y) && (76 == main__x)) && (\old(__return_720) == __return_720))) || (((78 == main__y) && (\old(__return_720) == __return_720)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_720) == __return_720)) && (82 == main__y))) || (((\old(__return_720) == __return_720) && (77 == main__x)) && (77 == main__y))) - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((((main__y == 50) && (main__x <= 4)) && (\old(__return_720) == __return_720)) && (1 <= main__x)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 5)) && (1 <= main__x)) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:04:52,474 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE