./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/cggmp2005b.i -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 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:03:26,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:03:26,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:03:26,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:03:26,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:03:26,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:03:26,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:03:26,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:03:26,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:03:26,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:03:26,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:03:26,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:03:26,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:03:26,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:03:26,320 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:03:26,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:03:26,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:03:26,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:03:26,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:03:26,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:03:26,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:03:26,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:03:26,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:03:26,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:03:26,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:03:26,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:03:26,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:03:26,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:03:26,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:03:26,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:03:26,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:03:26,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:03:26,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:03:26,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:03:26,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:03:26,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:03:26,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:03:26,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:03:26,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:03:26,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:03:26,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:03:26,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:03:26,334 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 -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:03:26,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:03:26,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:03:26,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:03:26,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:03:26,654 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:03:26,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-09-12 18:03:28,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:03:28,569 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:03:28,569 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-09-12 18:03:28,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/793dd2f4d/8ec9412408724386b084797875d46e0e/FLAGaf091b0c4 [2024-09-12 18:03:28,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/793dd2f4d/8ec9412408724386b084797875d46e0e [2024-09-12 18:03:28,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:03:28,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:03:28,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:03:28,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:03:28,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:03:28,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ce25d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28, skipping insertion in model container [2024-09-12 18:03:28,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:03:28,753 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/cggmp2005b.i[895,908] [2024-09-12 18:03:28,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:03:28,774 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:03:28,785 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/cggmp2005b.i[895,908] [2024-09-12 18:03:28,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:03:28,799 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:03:28,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28 WrapperNode [2024-09-12 18:03:28,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:03:28,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:03:28,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:03:28,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:03:28,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,820 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:03:28,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:03:28,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:03:28,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:03:28,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:03:28,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 18:03:28,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:03:28,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:03:28,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:03:28,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:03:28,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (1/1) ... [2024-09-12 18:03:28,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:03:28,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:28,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:03:28,887 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:03:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:03:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:03:28,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:03:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:03:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:03:28,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:03:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:03:28,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:03:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:03:28,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:03:28,996 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:03:28,998 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:03:29,184 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-12 18:03:29,184 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:03:29,216 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:03:29,216 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-12 18:03:29,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:29 BoogieIcfgContainer [2024-09-12 18:03:29,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:03:29,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:03:29,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:03:29,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:03:29,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:03:28" (1/3) ... [2024-09-12 18:03:29,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4941f18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:03:29, skipping insertion in model container [2024-09-12 18:03:29,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:03:28" (2/3) ... [2024-09-12 18:03:29,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4941f18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:03:29, skipping insertion in model container [2024-09-12 18:03:29,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:29" (3/3) ... [2024-09-12 18:03:29,249 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2024-09-12 18:03:29,265 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:03:29,265 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-12 18:03:29,334 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:03:29,344 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;@7597bb4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:03:29,346 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-12 18:03:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:03:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-12 18:03:29,357 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:29,358 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:29,359 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:29,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 770008094, now seen corresponding path program 1 times [2024-09-12 18:03:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:29,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893282605] [2024-09-12 18:03:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:29,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893282605] [2024-09-12 18:03:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893282605] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:03:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153687483] [2024-09-12 18:03:29,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:29,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:03:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:03:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:03:29,583 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:29,635 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-12 18:03:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:03:29,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2024-09-12 18:03:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:29,645 INFO L225 Difference]: With dead ends: 62 [2024-09-12 18:03:29,645 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 18:03:29,648 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:03:29,651 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:29,653 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 18:03:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-12 18:03:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.5) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-12 18:03:29,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 7 [2024-09-12 18:03:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:29,687 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-12 18:03:29,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:29,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-12 18:03:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 18:03:29,689 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:29,689 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:29,689 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:03:29,689 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:29,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash -109151628, now seen corresponding path program 1 times [2024-09-12 18:03:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:29,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978459393] [2024-09-12 18:03:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978459393] [2024-09-12 18:03:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978459393] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763141484] [2024-09-12 18:03:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:29,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:29,785 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:29,835 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-09-12 18:03:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 18:03:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:29,837 INFO L225 Difference]: With dead ends: 42 [2024-09-12 18:03:29,837 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 18:03:29,838 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:29,839 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:29,839 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 18:03:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-12 18:03:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-09-12 18:03:29,849 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 10 [2024-09-12 18:03:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:29,849 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-09-12 18:03:29,849 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:29,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-09-12 18:03:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:03:29,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:29,850 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:29,851 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:03:29,851 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:29,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 911266889, now seen corresponding path program 1 times [2024-09-12 18:03:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561693844] [2024-09-12 18:03:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:29,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:29,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561693844] [2024-09-12 18:03:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561693844] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:29,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:29,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:29,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633186471] [2024-09-12 18:03:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:29,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:03:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:03:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:29,999 INFO L87 Difference]: Start difference. First operand 38 states and 47 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:03:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:30,084 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-09-12 18:03:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:03:30,084 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:03:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:30,089 INFO L225 Difference]: With dead ends: 51 [2024-09-12 18:03:30,089 INFO L226 Difference]: Without dead ends: 50 [2024-09-12 18:03:30,090 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:03:30,091 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:30,091 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-12 18:03:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2024-09-12 18:03:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-12 18:03:30,108 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 11 [2024-09-12 18:03:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:30,109 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-12 18:03:30,109 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:03:30,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-12 18:03:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:03:30,110 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:30,111 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:30,111 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:03:30,111 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:30,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1815550850, now seen corresponding path program 1 times [2024-09-12 18:03:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452785090] [2024-09-12 18:03:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:30,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452785090] [2024-09-12 18:03:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452785090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:30,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106579268] [2024-09-12 18:03:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:30,148 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:03:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:03:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:03:30,149 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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:03:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:30,169 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-09-12 18:03:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:03:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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:03:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:30,171 INFO L225 Difference]: With dead ends: 62 [2024-09-12 18:03:30,171 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 18:03:30,171 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:03:30,172 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:30,173 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 18:03:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 18:03:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-12 18:03:30,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 12 [2024-09-12 18:03:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:30,180 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-12 18:03:30,180 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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:03:30,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-12 18:03:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:03:30,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:30,181 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:30,181 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 18:03:30,182 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:30,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -445846229, now seen corresponding path program 1 times [2024-09-12 18:03:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504036380] [2024-09-12 18:03:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:30,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,266 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:03:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504036380] [2024-09-12 18:03:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504036380] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651554378] [2024-09-12 18:03:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:30,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:03:30,271 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 18:03:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:03:30,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:30,400 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:03:30,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:03:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651554378] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:03:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-12 18:03:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612235466] [2024-09-12 18:03:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:30,413 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:03:30,414 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:03:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:30,468 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-09-12 18:03:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2024-09-12 18:03:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:30,469 INFO L225 Difference]: With dead ends: 44 [2024-09-12 18:03:30,469 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 18:03:30,470 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:03:30,470 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:30,471 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 18:03:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2024-09-12 18:03:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-12 18:03:30,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 13 [2024-09-12 18:03:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:30,488 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-12 18:03:30,490 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:03:30,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-12 18:03:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 18:03:30,491 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:30,491 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:30,512 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 18:03:30,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:30,697 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:30,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash -936331150, now seen corresponding path program 1 times [2024-09-12 18:03:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467678175] [2024-09-12 18:03:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467678175] [2024-09-12 18:03:30,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467678175] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125930425] [2024-09-12 18:03:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:30,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:03:30,765 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 18:03:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:30,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:03:30,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:30,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125930425] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:30,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-09-12 18:03:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319461456] [2024-09-12 18:03:30,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:30,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:03:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:03:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:03:30,972 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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:03:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:31,329 INFO L93 Difference]: Finished difference Result 138 states and 181 transitions. [2024-09-12 18:03:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-12 18:03:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 14 [2024-09-12 18:03:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:31,332 INFO L225 Difference]: With dead ends: 138 [2024-09-12 18:03:31,332 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 18:03:31,333 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2024-09-12 18:03:31,334 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 242 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:31,334 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 107 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:03:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 18:03:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2024-09-12 18:03:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 70 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-09-12 18:03:31,360 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 14 [2024-09-12 18:03:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:31,360 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-09-12 18:03:31,360 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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:03:31,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-09-12 18:03:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:03:31,362 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:31,362 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:31,381 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:03:31,565 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:03:31,566 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:31,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1467297054, now seen corresponding path program 1 times [2024-09-12 18:03:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718707007] [2024-09-12 18:03:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:31,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:03:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718707007] [2024-09-12 18:03:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718707007] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051330249] [2024-09-12 18:03:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:31,594 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:03:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:03:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:03:31,595 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:31,616 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2024-09-12 18:03:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:03:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 18:03:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:31,617 INFO L225 Difference]: With dead ends: 121 [2024-09-12 18:03:31,617 INFO L226 Difference]: Without dead ends: 65 [2024-09-12 18:03:31,618 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:03:31,619 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:31,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-12 18:03:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-12 18:03:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.293103448275862) internal successors, (75), 60 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-09-12 18:03:31,635 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 18 [2024-09-12 18:03:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:31,636 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-09-12 18:03:31,636 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2024-09-12 18:03:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 18:03:31,637 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:31,637 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:31,637 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:03:31,638 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:31,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 195347890, now seen corresponding path program 1 times [2024-09-12 18:03:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928212146] [2024-09-12 18:03:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:31,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:03:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928212146] [2024-09-12 18:03:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928212146] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107359067] [2024-09-12 18:03:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:31,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:31,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:31,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:03:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 18:03:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:31,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:03:31,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:03:31,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:03:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:03:31,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107359067] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:03:31,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:03:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 18:03:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832549957] [2024-09-12 18:03:31,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:03:31,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:03:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:03:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:03:31,787 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:31,854 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2024-09-12 18:03:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:03:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 18:03:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:31,856 INFO L225 Difference]: With dead ends: 153 [2024-09-12 18:03:31,856 INFO L226 Difference]: Without dead ends: 147 [2024-09-12 18:03:31,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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:03:31,857 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:31,858 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-09-12 18:03:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-09-12 18:03:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.264) internal successors, (158), 126 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-09-12 18:03:31,893 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 22 [2024-09-12 18:03:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:31,893 INFO L474 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-09-12 18:03:31,893 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:31,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-09-12 18:03:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:03:31,895 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:31,895 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:31,912 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 18:03:32,098 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 18:03:32,099 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:32,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash 835659369, now seen corresponding path program 2 times [2024-09-12 18:03:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383072342] [2024-09-12 18:03:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:03:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383072342] [2024-09-12 18:03:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383072342] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:03:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134647146] [2024-09-12 18:03:32,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:03:32,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:03:32,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:03:32,282 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 18:03:32,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 18:03:32,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:03:32,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:03:32,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:03:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-12 18:03:32,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:03:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134647146] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:32,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:03:32,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-09-12 18:03:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506578559] [2024-09-12 18:03:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:32,383 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:03:32,384 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:03:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:32,443 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2024-09-12 18:03:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-12 18:03:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:32,445 INFO L225 Difference]: With dead ends: 132 [2024-09-12 18:03:32,445 INFO L226 Difference]: Without dead ends: 131 [2024-09-12 18:03:32,446 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:03:32,446 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:32,447 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-12 18:03:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2024-09-12 18:03:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 121 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2024-09-12 18:03:32,477 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 29 [2024-09-12 18:03:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:32,478 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2024-09-12 18:03:32,478 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:03:32,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2024-09-12 18:03:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 18:03:32,479 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:32,480 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:32,498 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 18:03:32,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:03:32,681 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:32,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1240771502, now seen corresponding path program 1 times [2024-09-12 18:03:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058077459] [2024-09-12 18:03:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:03:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058077459] [2024-09-12 18:03:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058077459] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:03:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897510425] [2024-09-12 18:03:32,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:32,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:03:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:03:32,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:03:32,718 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:03:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:32,743 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions. [2024-09-12 18:03:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:03:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 32 [2024-09-12 18:03:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:32,745 INFO L225 Difference]: With dead ends: 152 [2024-09-12 18:03:32,745 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 18:03:32,745 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:03:32,746 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:32,746 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 18:03:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2024-09-12 18:03:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-09-12 18:03:32,759 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 32 [2024-09-12 18:03:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:32,759 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-09-12 18:03:32,759 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:03:32,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-09-12 18:03:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 18:03:32,761 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:03:32,761 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:32,761 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 18:03:32,761 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:03:32,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 536481762, now seen corresponding path program 2 times [2024-09-12 18:03:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:03:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742932494] [2024-09-12 18:03:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:03:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:03:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:03:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:03:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-12 18:03:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:03:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742932494] [2024-09-12 18:03:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742932494] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:03:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:03:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:03:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39738868] [2024-09-12 18:03:32,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:03:32,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:03:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:03:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:03:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:03:32,827 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:03:32,851 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-09-12 18:03:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:03:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-12 18:03:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:03:32,852 INFO L225 Difference]: With dead ends: 41 [2024-09-12 18:03:32,852 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:03:32,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:03:32,854 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:03:32,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:03:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:03:32,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:03:32,855 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:03:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:03:32,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-09-12 18:03:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:03:32,855 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:03:32,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:03:32,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:03:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:03:32,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:03:32,859 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-09-12 18:03:32,859 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-09-12 18:03:32,859 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-09-12 18:03:32,860 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-09-12 18:03:32,860 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-09-12 18:03:32,860 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-09-12 18:03:32,860 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-09-12 18:03:32,860 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 18:03:32,863 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:03:32,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:03:33,481 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:03:33,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:03:33 BoogieIcfgContainer [2024-09-12 18:03:33,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:03:33,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:03:33,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:03:33,499 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:03:33,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:03:29" (3/4) ... [2024-09-12 18:03:33,501 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:03:33,504 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:03:33,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:03:33,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 18:03:33,507 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 18:03:33,508 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 18:03:33,508 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 18:03:33,508 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:03:33,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:03:33,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:03:33,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:03:33,589 INFO L158 Benchmark]: Toolchain (without parser) took 4993.19ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 56.0MB in the beginning and 36.9MB in the end (delta: 19.0MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,589 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:03:33,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.03ms. Allocated memory is still 81.8MB. Free memory was 55.7MB in the beginning and 43.5MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.52ms. Allocated memory is still 81.8MB. Free memory was 43.5MB in the beginning and 42.7MB in the end (delta: 758.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,590 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 81.8MB. Free memory was 42.7MB in the beginning and 41.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,590 INFO L158 Benchmark]: RCFGBuilder took 364.42ms. Allocated memory is still 81.8MB. Free memory was 41.0MB in the beginning and 29.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,590 INFO L158 Benchmark]: TraceAbstraction took 4260.42ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 61.6MB in the beginning and 41.1MB in the end (delta: 20.5MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,590 INFO L158 Benchmark]: Witness Printer took 89.76ms. Allocated memory is still 111.1MB. Free memory was 41.1MB in the beginning and 36.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 18:03:33,592 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.24ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.03ms. Allocated memory is still 81.8MB. Free memory was 55.7MB in the beginning and 43.5MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.52ms. Allocated memory is still 81.8MB. Free memory was 43.5MB in the beginning and 42.7MB in the end (delta: 758.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 81.8MB. Free memory was 42.7MB in the beginning and 41.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.42ms. Allocated memory is still 81.8MB. Free memory was 41.0MB in the beginning and 29.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4260.42ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 61.6MB in the beginning and 41.1MB in the end (delta: 20.5MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * Witness Printer took 89.76ms. Allocated memory is still 111.1MB. Free memory was 41.1MB in the beginning and 36.9MB 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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 4 procedures, 32 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 202 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 286 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 174/251 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 7 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((20 <= j) && (k == 4)) && (1 <= i)) || (((4 <= k) && (((long long) j + 100) == 0)) && (i == 0))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((0 <= ((long long) j + 100)) && (4 <= k)) && (i == 1)) || (((20 <= j) && (k == 4)) && (1 <= i))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((20 <= j) && (k == 4)) && (1 <= i)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:03:33,618 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