./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --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:21:36,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:21:36,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:21:36,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:21:36,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:21:36,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:21:36,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:21:36,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:21:36,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:21:36,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:21:36,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:21:36,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:21:36,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:21:36,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:21:36,604 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:21:36,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:21:36,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:21:36,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:21:36,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:21:36,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:21:36,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:21:36,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:21:36,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:21:36,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:21:36,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:21:36,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:21:36,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:21:36,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:21:36,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:21:36,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:21:36,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:21:36,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:21:36,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:21:36,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:21:36,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:21:36,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:21:36,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:21:36,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:21:36,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:21:36,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:21:36,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:21:36,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:21:36,629 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 -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f 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:21:36,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:21:36,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:21:36,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:21:36,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:21:36,976 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:21:36,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_2.c [2024-09-12 18:21:38,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:21:38,813 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:21:38,813 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_2.c [2024-09-12 18:21:38,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b9942cd32/9b4fcb5ea6504569ab65fb6562e354db/FLAG96b1ed993 [2024-09-12 18:21:39,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b9942cd32/9b4fcb5ea6504569ab65fb6562e354db [2024-09-12 18:21:39,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:21:39,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:21:39,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:21:39,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:21:39,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:21:39,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6672d561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39, skipping insertion in model container [2024-09-12 18:21:39,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:21:39,372 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-simple/nested_2.c[730,743] [2024-09-12 18:21:39,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:21:39,402 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:21:39,421 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-simple/nested_2.c[730,743] [2024-09-12 18:21:39,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:21:39,442 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:21:39,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39 WrapperNode [2024-09-12 18:21:39,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:21:39,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:21:39,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:21:39,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:21:39,453 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:21:39" (1/1) ... [2024-09-12 18:21:39,459 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:21:39" (1/1) ... [2024-09-12 18:21:39,467 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:21:39,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:21:39,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:21:39,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:21:39,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:21:39,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,495 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:21:39,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:21:39,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:21:39,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:21:39,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:21:39,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (1/1) ... [2024-09-12 18:21:39,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:21:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:39,541 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:21:39,548 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:21:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:21:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:21:39,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:21:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:21:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:21:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:21:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:21:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:21:39,652 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:21:39,655 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:21:39,788 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 18:21:39,789 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:21:39,817 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:21:39,817 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:21:39,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:21:39 BoogieIcfgContainer [2024-09-12 18:21:39,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:21:39,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:21:39,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:21:39,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:21:39,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:21:39" (1/3) ... [2024-09-12 18:21:39,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b13ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:21:39, skipping insertion in model container [2024-09-12 18:21:39,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:39" (2/3) ... [2024-09-12 18:21:39,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b13ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:21:39, skipping insertion in model container [2024-09-12 18:21:39,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:21:39" (3/3) ... [2024-09-12 18:21:39,825 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_2.c [2024-09-12 18:21:39,842 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:21:39,842 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 18:21:39,903 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:21:39,911 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;@5da913d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:21:39,912 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 18:21:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 17 states have internal predecessors, (22), 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:21:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 18:21:39,923 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:39,924 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:39,925 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:39,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2062064251, now seen corresponding path program 1 times [2024-09-12 18:21:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579179482] [2024-09-12 18:21:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,065 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:21:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579179482] [2024-09-12 18:21:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579179482] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:21:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294141255] [2024-09-12 18:21:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:40,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 18:21:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 18:21:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:21:40,094 INFO L87 Difference]: Start difference. First operand has 22 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 17 states have internal predecessors, (22), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:40,120 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-09-12 18:21:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 18:21:40,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 18:21:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:40,127 INFO L225 Difference]: With dead ends: 39 [2024-09-12 18:21:40,127 INFO L226 Difference]: Without dead ends: 18 [2024-09-12 18:21:40,130 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:21:40,134 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:40,135 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-12 18:21:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-12 18:21:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 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:21:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-09-12 18:21:40,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2024-09-12 18:21:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:40,162 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-09-12 18:21:40,162 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-09-12 18:21:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 18:21:40,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:40,164 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:40,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:21:40,164 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:40,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2062087315, now seen corresponding path program 1 times [2024-09-12 18:21:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677148266] [2024-09-12 18:21:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,261 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:21:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677148266] [2024-09-12 18:21:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677148266] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:40,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:21:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831541490] [2024-09-12 18:21:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:40,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:21:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:40,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:21:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:40,269 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:40,294 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-12 18:21:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:21:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 18:21:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:40,296 INFO L225 Difference]: With dead ends: 31 [2024-09-12 18:21:40,296 INFO L226 Difference]: Without dead ends: 26 [2024-09-12 18:21:40,296 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:40,298 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:40,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-12 18:21:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-12 18:21:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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:21:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-12 18:21:40,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2024-09-12 18:21:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:40,309 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-12 18:21:40,310 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-12 18:21:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 18:21:40,311 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:40,311 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:40,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:21:40,312 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:40,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2062085968, now seen corresponding path program 1 times [2024-09-12 18:21:40,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116303833] [2024-09-12 18:21:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,401 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:21:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116303833] [2024-09-12 18:21:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116303833] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:40,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:40,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:21:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994037629] [2024-09-12 18:21:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:40,408 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:21:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:21:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:40,409 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:40,461 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-09-12 18:21:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:21:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 18:21:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:40,463 INFO L225 Difference]: With dead ends: 45 [2024-09-12 18:21:40,463 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 18:21:40,463 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:40,465 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:40,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 18:21:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 18:21:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 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:21:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-12 18:21:40,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 8 [2024-09-12 18:21:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:40,473 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-12 18:21:40,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-12 18:21:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:21:40,475 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:40,475 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:40,475 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:21:40,476 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:40,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash -685782549, now seen corresponding path program 1 times [2024-09-12 18:21:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589495205] [2024-09-12 18:21:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589495205] [2024-09-12 18:21:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589495205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169940352] [2024-09-12 18:21:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:40,561 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:21:40,565 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:21:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:21:40,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:40,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:21:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169940352] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:21:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-09-12 18:21:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821428694] [2024-09-12 18:21:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:40,670 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:21:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:21:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:21:40,674 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:40,716 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-12 18:21:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:21:40,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 18:21:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:40,718 INFO L225 Difference]: With dead ends: 30 [2024-09-12 18:21:40,718 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 18:21:40,718 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:21:40,719 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:40,720 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 18:21:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-12 18:21:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 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:21:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-09-12 18:21:40,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2024-09-12 18:21:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:40,732 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-09-12 18:21:40,732 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:40,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-09-12 18:21:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:21:40,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:40,733 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:40,751 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:21:40,937 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:40,938 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:40,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 215577517, now seen corresponding path program 1 times [2024-09-12 18:21:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872295490] [2024-09-12 18:21:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:21:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872295490] [2024-09-12 18:21:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872295490] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:21:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461259792] [2024-09-12 18:21:40,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:40,986 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:21:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:21:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:40,988 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:41,005 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-09-12 18:21:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:21:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 18:21:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:41,006 INFO L225 Difference]: With dead ends: 29 [2024-09-12 18:21:41,006 INFO L226 Difference]: Without dead ends: 28 [2024-09-12 18:21:41,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:21:41,008 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:41,008 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-12 18:21:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-09-12 18:21:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 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:21:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-12 18:21:41,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2024-09-12 18:21:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:41,015 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-12 18:21:41,015 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:41,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-12 18:21:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 18:21:41,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:41,016 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:41,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:21:41,016 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:41,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1243157920, now seen corresponding path program 1 times [2024-09-12 18:21:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028362689] [2024-09-12 18:21:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:41,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028362689] [2024-09-12 18:21:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028362689] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769176308] [2024-09-12 18:21:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:41,103 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:21:41,105 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:21:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:41,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:21:41,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:41,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:41,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769176308] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:41,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:21:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 18:21:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710379079] [2024-09-12 18:21:41,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:41,215 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:21:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:21:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:21:41,216 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:41,268 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-12 18:21:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:21:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 18:21:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:41,269 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:21:41,269 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 18:21:41,270 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:21:41,272 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:41,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 18:21:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-12 18:21:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 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:21:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-09-12 18:21:41,288 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 15 [2024-09-12 18:21:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:41,288 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-09-12 18:21:41,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:41,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-09-12 18:21:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:21:41,293 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:41,293 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:41,313 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 18:21:41,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 18:21:41,495 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:41,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1461165605, now seen corresponding path program 2 times [2024-09-12 18:21:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528541464] [2024-09-12 18:21:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:41,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-12 18:21:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528541464] [2024-09-12 18:21:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528541464] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30820571] [2024-09-12 18:21:41,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:21:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:41,551 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:21:41,554 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:21:41,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:21:41,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:21:41,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 18:21:41,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:41,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30820571] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:41,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:21:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-12 18:21:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649368316] [2024-09-12 18:21:41,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:41,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:21:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:21:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:21:41,784 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:42,017 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-09-12 18:21:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 18:21:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-12 18:21:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:42,019 INFO L225 Difference]: With dead ends: 99 [2024-09-12 18:21:42,019 INFO L226 Difference]: Without dead ends: 76 [2024-09-12 18:21:42,020 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-12 18:21:42,020 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:42,020 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:21:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-12 18:21:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-12 18:21:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1) internal successors, (77), 72 states have internal predecessors, (77), 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:21:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-09-12 18:21:42,038 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 24 [2024-09-12 18:21:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:42,038 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-09-12 18:21:42,038 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:42,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-09-12 18:21:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 18:21:42,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:42,042 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:42,059 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 18:21:42,242 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 18:21:42,243 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:42,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1398186575, now seen corresponding path program 1 times [2024-09-12 18:21:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:42,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580652508] [2024-09-12 18:21:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:42,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-09-12 18:21:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580652508] [2024-09-12 18:21:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580652508] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087133521] [2024-09-12 18:21:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:42,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:42,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:42,366 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:21:42,368 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:21:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:42,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:21:42,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-09-12 18:21:42,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:21:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087133521] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:21:42,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-09-12 18:21:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981826795] [2024-09-12 18:21:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:42,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:21:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:21:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:21:42,505 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:42,545 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-09-12 18:21:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:21:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-12 18:21:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:42,547 INFO L225 Difference]: With dead ends: 76 [2024-09-12 18:21:42,547 INFO L226 Difference]: Without dead ends: 75 [2024-09-12 18:21:42,547 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:21:42,548 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:42,548 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-12 18:21:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-09-12 18:21:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 71 states have internal predecessors, (75), 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:21:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-09-12 18:21:42,573 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 48 [2024-09-12 18:21:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:42,573 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-09-12 18:21:42,573 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:42,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-09-12 18:21:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 18:21:42,575 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:42,575 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:42,594 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 18:21:42,781 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:42,782 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:42,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1485726493, now seen corresponding path program 3 times [2024-09-12 18:21:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408734201] [2024-09-12 18:21:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:42,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-09-12 18:21:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408734201] [2024-09-12 18:21:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408734201] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622805974] [2024-09-12 18:21:42,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:21:42,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:42,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:42,920 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:21:42,921 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:21:42,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-09-12 18:21:42,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:21:42,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:21:42,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-09-12 18:21:43,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-09-12 18:21:43,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622805974] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:43,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:21:43,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-12 18:21:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956764405] [2024-09-12 18:21:43,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:43,127 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 18:21:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:43,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 18:21:43,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:21:43,128 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:43,189 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2024-09-12 18:21:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:21:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-09-12 18:21:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:43,191 INFO L225 Difference]: With dead ends: 145 [2024-09-12 18:21:43,192 INFO L226 Difference]: Without dead ends: 141 [2024-09-12 18:21:43,192 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:21:43,192 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:43,193 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-09-12 18:21:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-09-12 18:21:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.051094890510949) internal successors, (144), 137 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:21:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2024-09-12 18:21:43,234 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 52 [2024-09-12 18:21:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:43,234 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2024-09-12 18:21:43,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:43,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2024-09-12 18:21:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-09-12 18:21:43,240 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:43,240 INFO L216 NwaCegarLoop]: trace histogram [36, 36, 36, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:43,258 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:21:43,444 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:43,445 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:21:43,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1172748925, now seen corresponding path program 4 times [2024-09-12 18:21:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832302856] [2024-09-12 18:21:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:44,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 1917 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-09-12 18:21:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832302856] [2024-09-12 18:21:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832302856] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041325923] [2024-09-12 18:21:44,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 18:21:44,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:44,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:44,031 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:21:44,044 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:21:44,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 18:21:44,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:21:44,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 18:21:44,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 1917 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-09-12 18:21:44,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 1917 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-09-12 18:21:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041325923] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:45,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:21:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 29 [2024-09-12 18:21:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364469905] [2024-09-12 18:21:45,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:45,016 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-12 18:21:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-12 18:21:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2024-09-12 18:21:45,017 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:45,694 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2024-09-12 18:21:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-12 18:21:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2024-09-12 18:21:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:45,697 INFO L225 Difference]: With dead ends: 141 [2024-09-12 18:21:45,697 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:21:45,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 266 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1421, Invalid=3271, Unknown=0, NotChecked=0, Total=4692 [2024-09-12 18:21:45,700 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:45,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:21:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:21:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:21:45,701 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:21:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:21:45,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2024-09-12 18:21:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:45,701 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:21:45,702 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:45,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:21:45,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:21:45,704 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-09-12 18:21:45,705 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 18:21:45,705 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 18:21:45,705 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 18:21:45,705 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-09-12 18:21:45,722 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 18:21:45,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 18:21:45,909 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:45,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:21:46,768 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:21:46,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:21:46 BoogieIcfgContainer [2024-09-12 18:21:46,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:21:46,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:21:46,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:21:46,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:21:46,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:21:39" (3/4) ... [2024-09-12 18:21:46,787 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:21:46,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:21:46,791 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:21:46,794 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 18:21:46,794 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 18:21:46,795 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 18:21:46,795 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:21:46,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:21:46,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:21:46,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:21:46,885 INFO L158 Benchmark]: Toolchain (without parser) took 7689.17ms. Allocated memory was 73.4MB in the beginning and 132.1MB in the end (delta: 58.7MB). Free memory was 40.8MB in the beginning and 73.0MB in the end (delta: -32.2MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,885 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 25.3MB in the beginning and 25.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:21:46,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.32ms. Allocated memory is still 73.4MB. Free memory was 40.6MB in the beginning and 51.8MB in the end (delta: -11.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 50.9MB in the end (delta: 874.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,886 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 73.4MB. Free memory was 50.9MB in the beginning and 49.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,886 INFO L158 Benchmark]: RCFGBuilder took 311.63ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 38.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,886 INFO L158 Benchmark]: TraceAbstraction took 6963.85ms. Allocated memory was 73.4MB in the beginning and 132.1MB in the end (delta: 58.7MB). Free memory was 37.3MB in the beginning and 77.2MB in the end (delta: -39.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,886 INFO L158 Benchmark]: Witness Printer took 100.40ms. Allocated memory is still 132.1MB. Free memory was 77.2MB in the beginning and 73.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 18:21:46,887 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.18ms. Allocated memory is still 50.3MB. Free memory was 25.3MB in the beginning and 25.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.32ms. Allocated memory is still 73.4MB. Free memory was 40.6MB in the beginning and 51.8MB in the end (delta: -11.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 50.9MB in the end (delta: 874.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 73.4MB. Free memory was 50.9MB in the beginning and 49.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.63ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 38.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6963.85ms. Allocated memory was 73.4MB in the beginning and 132.1MB in the end (delta: 58.7MB). Free memory was 37.3MB in the beginning and 77.2MB in the end (delta: -39.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 100.40ms. Allocated memory is still 132.1MB. Free memory was 77.2MB in the beginning and 73.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 36, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 125 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 634 GetRequests, 516 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=9, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 616 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 1430/7732 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 5 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((a == 0) && (b == 0)) || (((a == 0) && (b <= 6)) && (1 <= b))) || (((b == 0) && (1 <= a)) && (a <= 5))) || ((((b <= 6) && (1 <= a)) && (1 <= b)) && (a <= 5))) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((a == 0) && (b == 6)) || (((b == 6) && (1 <= a)) && (a <= 6))) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:21:46,916 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE