./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:55:19,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:55:19,579 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:55:19,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:55:19,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:55:19,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:55:19,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:55:19,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:55:19,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:55:19,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:55:19,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:55:19,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:55:19,644 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:55:19,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:55:19,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:55:19,648 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:55:19,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:55:19,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:55:19,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:55:19,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:55:19,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:55:19,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:55:19,652 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:55:19,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:55:19,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:55:19,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:55:19,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:55:19,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:55:19,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:55:19,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:55:19,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:55:19,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:55:19,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:55:19,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:55:19,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:55:19,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:55:19,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:55:19,661 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:55:19,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:55:19,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:55:19,661 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:55:19,662 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! overflow) ) 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2023-11-06 22:55:20,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:55:20,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:55:20,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:55:20,102 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:55:20,102 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:55:20,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2023-11-06 22:55:23,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:55:23,760 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:55:23,761 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2023-11-06 22:55:23,773 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/data/502787e46/2dc9fba57fdf496faa9181b1be991280/FLAGc4512349f [2023-11-06 22:55:23,794 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/data/502787e46/2dc9fba57fdf496faa9181b1be991280 [2023-11-06 22:55:23,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:55:23,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:55:23,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:23,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:55:23,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:55:23,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:23" (1/1) ... [2023-11-06 22:55:23,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380df1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:23, skipping insertion in model container [2023-11-06 22:55:23,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:23" (1/1) ... [2023-11-06 22:55:23,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:55:24,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:24,121 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:55:24,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:24,167 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:55:24,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24 WrapperNode [2023-11-06 22:55:24,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:24,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:24,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:55:24,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:55:24,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,236 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-11-06 22:55:24,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:24,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:55:24,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:55:24,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:55:24,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:55:24,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:55:24,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:55:24,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:55:24,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (1/1) ... [2023-11-06 22:55:24,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:55:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:24,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:55:24,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:55:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:55:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:55:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:55:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:55:24,453 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:55:24,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:55:24,831 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:55:24,841 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:55:24,843 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:55:24,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:24 BoogieIcfgContainer [2023-11-06 22:55:24,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:55:24,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:55:24,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:55:24,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:55:24,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:55:23" (1/3) ... [2023-11-06 22:55:24,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a47ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:24, skipping insertion in model container [2023-11-06 22:55:24,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:24" (2/3) ... [2023-11-06 22:55:24,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a47ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:24, skipping insertion in model container [2023-11-06 22:55:24,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:24" (3/3) ... [2023-11-06 22:55:24,863 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2023-11-06 22:55:24,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:55:24,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-11-06 22:55:24,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:55:24,985 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7e72c2cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:55:24,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-06 22:55:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 35 states have (on average 1.8) internal successors, (63), 58 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:55:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:55:25,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:25,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:55:25,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:25,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2023-11-06 22:55:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687611726] [2023-11-06 22:55:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687611726] [2023-11-06 22:55:25,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687611726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:25,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082902890] [2023-11-06 22:55:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:25,371 INFO L87 Difference]: Start difference. First operand has 67 states, 35 states have (on average 1.8) internal successors, (63), 58 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-06 22:55:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:25,645 INFO L93 Difference]: Finished difference Result 159 states and 209 transitions. [2023-11-06 22:55:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2023-11-06 22:55:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:25,665 INFO L225 Difference]: With dead ends: 159 [2023-11-06 22:55:25,667 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:55:25,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:25,681 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:25,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:55:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:55:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2023-11-06 22:55:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 59 states have internal predecessors, (61), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:55:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2023-11-06 22:55:25,737 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 5 [2023-11-06 22:55:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:25,738 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2023-11-06 22:55:25,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-06 22:55:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2023-11-06 22:55:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:55:25,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:25,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:55:25,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:25,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2023-11-06 22:55:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209304829] [2023-11-06 22:55:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209304829] [2023-11-06 22:55:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209304829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:25,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:55:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089532242] [2023-11-06 22:55:25,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:55:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:55:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:55:25,797 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-06 22:55:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:25,867 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2023-11-06 22:55:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:55:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2023-11-06 22:55:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:25,870 INFO L225 Difference]: With dead ends: 135 [2023-11-06 22:55:25,870 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:55:25,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:55:25,873 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:25,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:55:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-11-06 22:55:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 59 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:55:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-06 22:55:25,888 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 7 [2023-11-06 22:55:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:25,889 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-06 22:55:25,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-06 22:55:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-06 22:55:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:55:25,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:25,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:25,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:55:25,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:25,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash 395086042, now seen corresponding path program 1 times [2023-11-06 22:55:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692262545] [2023-11-06 22:55:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692262545] [2023-11-06 22:55:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692262545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:55:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371144370] [2023-11-06 22:55:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:26,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:55:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:55:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:26,017 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:55:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:26,226 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2023-11-06 22:55:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:55:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-06 22:55:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:26,229 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:55:26,230 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:55:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:55:26,232 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:26,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 158 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:55:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:55:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2023-11-06 22:55:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.62) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:55:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2023-11-06 22:55:26,257 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 14 [2023-11-06 22:55:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:26,258 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2023-11-06 22:55:26,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:55:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2023-11-06 22:55:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:55:26,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:26,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:55:26,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:26,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash -637234523, now seen corresponding path program 1 times [2023-11-06 22:55:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:26,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089528560] [2023-11-06 22:55:26,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089528560] [2023-11-06 22:55:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089528560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:55:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909865065] [2023-11-06 22:55:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:55:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:55:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:26,359 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:55:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:26,509 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2023-11-06 22:55:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:55:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-06 22:55:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:26,511 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:55:26,511 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:55:26,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:55:26,514 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:26,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:55:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2023-11-06 22:55:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 72 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:55:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2023-11-06 22:55:26,533 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 15 [2023-11-06 22:55:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:26,533 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2023-11-06 22:55:26,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:55:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2023-11-06 22:55:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:55:26,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:26,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:26,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:55:26,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:26,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -147313453, now seen corresponding path program 1 times [2023-11-06 22:55:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:26,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006082200] [2023-11-06 22:55:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:55:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006082200] [2023-11-06 22:55:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006082200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:26,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938430471] [2023-11-06 22:55:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:26,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:26,630 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:55:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:26,725 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2023-11-06 22:55:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-06 22:55:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:26,728 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:55:26,728 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:55:26,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:26,730 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:26,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 94 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:55:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-11-06 22:55:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:55:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2023-11-06 22:55:26,745 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 23 [2023-11-06 22:55:26,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:26,745 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2023-11-06 22:55:26,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:55:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2023-11-06 22:55:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:55:26,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:26,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:55:26,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:26,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -271749675, now seen corresponding path program 1 times [2023-11-06 22:55:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661342339] [2023-11-06 22:55:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:55:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661342339] [2023-11-06 22:55:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661342339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:26,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690725943] [2023-11-06 22:55:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:26,831 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:55:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:26,897 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2023-11-06 22:55:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 22:55:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:26,902 INFO L225 Difference]: With dead ends: 159 [2023-11-06 22:55:26,909 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:55:26,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:26,915 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:26,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:55:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-11-06 22:55:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 67 states have internal predecessors, (75), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:55:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2023-11-06 22:55:26,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 24 [2023-11-06 22:55:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:26,950 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2023-11-06 22:55:26,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:55:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2023-11-06 22:55:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:55:26,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:26,959 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:26,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:55:26,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:26,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 839709403, now seen corresponding path program 1 times [2023-11-06 22:55:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85526344] [2023-11-06 22:55:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:55:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:27,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85526344] [2023-11-06 22:55:27,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85526344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:27,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:27,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:27,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474699647] [2023-11-06 22:55:27,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:27,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:27,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:27,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:27,156 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:55:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:27,251 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-11-06 22:55:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:55:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-06 22:55:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:27,253 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:55:27,253 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:55:27,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:27,255 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:27,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:55:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-11-06 22:55:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:55:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2023-11-06 22:55:27,271 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 36 [2023-11-06 22:55:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:27,272 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2023-11-06 22:55:27,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:55:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2023-11-06 22:55:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:55:27,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:27,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:27,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:55:27,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:27,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 261187771, now seen corresponding path program 1 times [2023-11-06 22:55:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396418985] [2023-11-06 22:55:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:27,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:55:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396418985] [2023-11-06 22:55:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396418985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771751168] [2023-11-06 22:55:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:27,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:27,355 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:55:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:27,426 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2023-11-06 22:55:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-11-06 22:55:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:27,431 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:55:27,431 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:55:27,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:27,437 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:27,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 88 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:55:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-11-06 22:55:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:55:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2023-11-06 22:55:27,466 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 37 [2023-11-06 22:55:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:27,467 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2023-11-06 22:55:27,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:55:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2023-11-06 22:55:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:55:27,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:27,482 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:27,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:55:27,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:27,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash -937582121, now seen corresponding path program 1 times [2023-11-06 22:55:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:27,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246552578] [2023-11-06 22:55:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:55:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:55:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246552578] [2023-11-06 22:55:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246552578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:55:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418126690] [2023-11-06 22:55:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:27,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:55:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:27,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:55:27,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:55:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:27,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:55:27,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:55:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:55:28,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:55:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:55:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418126690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:55:28,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:55:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-06 22:55:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536611684] [2023-11-06 22:55:28,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:55:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:55:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:55:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:55:28,213 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-06 22:55:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:28,564 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2023-11-06 22:55:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:55:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2023-11-06 22:55:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:28,566 INFO L225 Difference]: With dead ends: 165 [2023-11-06 22:55:28,566 INFO L226 Difference]: Without dead ends: 164 [2023-11-06 22:55:28,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:55:28,570 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:28,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 176 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:55:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-06 22:55:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2023-11-06 22:55:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 91 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:55:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2023-11-06 22:55:28,615 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 46 [2023-11-06 22:55:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:28,616 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2023-11-06 22:55:28,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-06 22:55:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2023-11-06 22:55:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:55:28,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:28,626 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:28,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:55:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:55:28,832 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:28,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -775072029, now seen corresponding path program 1 times [2023-11-06 22:55:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896077196] [2023-11-06 22:55:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:55:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:55:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-06 22:55:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896077196] [2023-11-06 22:55:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896077196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:55:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469088389] [2023-11-06 22:55:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:28,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:55:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:55:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:28,972 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:55:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:29,045 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2023-11-06 22:55:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2023-11-06 22:55:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:29,048 INFO L225 Difference]: With dead ends: 118 [2023-11-06 22:55:29,048 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:55:29,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:55:29,049 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:29,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:55:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-06 22:55:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 88 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:55:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2023-11-06 22:55:29,066 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 55 [2023-11-06 22:55:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:29,067 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2023-11-06 22:55:29,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:55:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2023-11-06 22:55:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 22:55:29,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:29,069 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:29,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:55:29,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:29,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash -725368722, now seen corresponding path program 1 times [2023-11-06 22:55:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561369080] [2023-11-06 22:55:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:55:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:55:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:55:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:55:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:55:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:55:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:55:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:55:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:55:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561369080] [2023-11-06 22:55:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561369080] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:55:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526160777] [2023-11-06 22:55:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:55:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:29,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:55:29,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:55:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:29,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:55:29,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:55:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:55:30,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:55:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:55:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526160777] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:55:30,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:55:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2023-11-06 22:55:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231358053] [2023-11-06 22:55:30,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:55:30,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 22:55:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 22:55:30,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:55:30,982 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2023-11-06 22:55:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:31,604 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2023-11-06 22:55:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:55:31,604 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 95 [2023-11-06 22:55:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:31,606 INFO L225 Difference]: With dead ends: 115 [2023-11-06 22:55:31,606 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:55:31,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2023-11-06 22:55:31,608 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:31,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 293 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:55:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:55:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-06 22:55:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:55:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2023-11-06 22:55:31,624 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 95 [2023-11-06 22:55:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:31,624 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2023-11-06 22:55:31,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2023-11-06 22:55:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2023-11-06 22:55:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:55:31,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:31,627 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:31,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:55:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:55:31,833 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-11-06 22:55:31,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1011593801, now seen corresponding path program 1 times [2023-11-06 22:55:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727523819] [2023-11-06 22:55:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:55:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:55:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:55:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:55:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:55:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:55:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:55:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:55:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:55:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:55:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:55:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2023-11-06 22:55:32,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727523819] [2023-11-06 22:55:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727523819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:55:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848795439] [2023-11-06 22:55:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:32,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:55:32,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:32,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:55:32,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:55:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:32,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:55:32,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:55:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:55:32,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:55:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:55:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848795439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:55:33,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:55:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-11-06 22:55:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401441927] [2023-11-06 22:55:33,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:55:33,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 22:55:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 22:55:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:55:33,109 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 21 states, 20 states have (on average 5.1) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-06 22:55:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:33,542 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2023-11-06 22:55:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:55:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.1) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 96 [2023-11-06 22:55:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:33,544 INFO L225 Difference]: With dead ends: 179 [2023-11-06 22:55:33,544 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:55:33,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:55:33,548 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 78 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:33,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 141 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:55:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:55:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:55:33,550 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) [2023-11-06 22:55:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:55:33,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-11-06 22:55:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:33,550 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:55:33,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.1) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-06 22:55:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:55:33,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:55:33,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2023-11-06 22:55:33,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2023-11-06 22:55:33,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2023-11-06 22:55:33,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2023-11-06 22:55:33,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2023-11-06 22:55:33,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2023-11-06 22:55:33,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2023-11-06 22:55:33,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2023-11-06 22:55:33,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2023-11-06 22:55:33,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2023-11-06 22:55:33,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2023-11-06 22:55:33,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2023-11-06 22:55:33,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2023-11-06 22:55:33,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2023-11-06 22:55:33,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2023-11-06 22:55:33,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2023-11-06 22:55:33,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2023-11-06 22:55:33,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:55:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:55:33,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:55:34,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2023-11-06 22:55:34,148 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (= |ULTIMATE.start_main_~j~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1073741823)) [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point L27-2(line 27) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point L23-2(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,149 INFO L895 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741822)) (and (= |ULTIMATE.start_main_~j~0#1| 4) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741823)))) [2023-11-06 22:55:34,149 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L895 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741822)) (and (= |ULTIMATE.start_main_~j~0#1| 4) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741823)))) [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 14 33) the Hoare annotation is: true [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-11-06 22:55:34,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point L28-2(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L895 garLoopResultBuilder]: At program point L28-3(line 28) the Hoare annotation is: (and (= |ULTIMATE.start_main_~j~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1073741823)) [2023-11-06 22:55:34,151 INFO L895 garLoopResultBuilder]: At program point L24(lines 18 25) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741822)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse2) (and (= |ULTIMATE.start_main_~j~0#1| 4) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741823)) (and (<= |ULTIMATE.start_main_~i~0#1| 1073741821) (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2))) [2023-11-06 22:55:34,151 INFO L895 garLoopResultBuilder]: At program point L28-4(line 28) the Hoare annotation is: (and (= |ULTIMATE.start_main_~j~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1073741823)) [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:55:34,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 31) the Hoare annotation is: (or (= |ULTIMATE.start_main_~i~0#1| 0) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (or (< |ULTIMATE.start_main_~i~0#1| 2147483648) (< (* 2 |ULTIMATE.start_main_~i~0#1|) (+ 4294967295 |ULTIMATE.start_main_~j~0#1|))))) [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point L16-3(lines 16 31) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:55:34,152 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-11-06 22:55:34,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-11-06 22:55:34,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,154 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741822)) (and (= |ULTIMATE.start_main_~j~0#1| 4) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741823)))) [2023-11-06 22:55:34,154 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-11-06 22:55:34,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,156 INFO L899 garLoopResultBuilder]: For program point L30-2(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L899 garLoopResultBuilder]: For program point L30-3(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L899 garLoopResultBuilder]: For program point L30-4(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-11-06 22:55:34,157 INFO L895 garLoopResultBuilder]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741822)) (and (= |ULTIMATE.start_main_~j~0#1| 4) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1073741823)))) [2023-11-06 22:55:34,158 INFO L899 garLoopResultBuilder]: For program point L22-2(line 22) no Hoare annotation was computed. [2023-11-06 22:55:34,159 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 25) the Hoare annotation is: (and (= |ULTIMATE.start_main_~j~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1073741823)) [2023-11-06 22:55:34,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-11-06 22:55:34,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-06 22:55:34,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-06 22:55:34,159 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-11-06 22:55:34,159 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-11-06 22:55:34,160 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-06 22:55:34,160 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-06 22:55:34,160 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-11-06 22:55:34,160 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-11-06 22:55:34,161 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-11-06 22:55:34,164 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:34,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:55:34,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:55:34 BoogieIcfgContainer [2023-11-06 22:55:34,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:55:34,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:55:34,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:55:34,186 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:55:34,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:24" (3/4) ... [2023-11-06 22:55:34,188 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:55:34,193 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 22:55:34,201 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:55:34,202 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:55:34,202 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:55:34,202 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:55:34,277 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:55:34,277 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:55:34,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:55:34,278 INFO L158 Benchmark]: Toolchain (without parser) took 10475.44ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 94.7MB in the beginning and 110.3MB in the end (delta: -15.5MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,278 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 134.2MB. Free memory was 102.7MB in the beginning and 102.7MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:55:34,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.49ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 84.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.94ms. Allocated memory is still 134.2MB. Free memory was 84.2MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,279 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 985.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:55:34,280 INFO L158 Benchmark]: RCFGBuilder took 580.58ms. Allocated memory is still 134.2MB. Free memory was 81.5MB in the beginning and 68.4MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,280 INFO L158 Benchmark]: TraceAbstraction took 9334.44ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 67.9MB in the beginning and 114.5MB in the end (delta: -46.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,281 INFO L158 Benchmark]: Witness Printer took 91.90ms. Allocated memory is still 201.3MB. Free memory was 114.5MB in the beginning and 110.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:55:34,283 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.37ms. Allocated memory is still 134.2MB. Free memory was 102.7MB in the beginning and 102.7MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.49ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 84.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.94ms. Allocated memory is still 134.2MB. Free memory was 84.2MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 985.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 580.58ms. Allocated memory is still 134.2MB. Free memory was 81.5MB in the beginning and 68.4MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9334.44ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 67.9MB in the beginning and 114.5MB in the end (delta: -46.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 91.90ms. Allocated memory is still 201.3MB. Free memory was 114.5MB in the beginning and 110.3MB 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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: 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: 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1109 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1708 IncrementalHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 536 mSDtfsCounter, 1708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 544 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=9, InterpolantAutomatonStates: 86, 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, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 80 PreInvPairs, 113 NumberOfFragments, 218 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1037 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 3611 SizeOfPredicates, 5 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 1857/1964 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 22 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && ((i < 2147483648) || ((2 * i) < (4294967295 + j))))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || (((2 == j) && (2 <= i)) && (i <= 1073741822))) || ((i == 0) && (j == 0))) || (((j == 4) && (2 <= i)) && (i <= 1073741823))) || (((i <= 1073741821) && (1 <= i)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:55:34,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dc489e1-273e-4234-a38c-83ef35771e65/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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