./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 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_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:31:07,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:31:07,707 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-12 02:31:07,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:31:07,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:31:07,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:31:07,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:31:07,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:31:07,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:31:07,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:31:07,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:31:07,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:31:07,769 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:31:07,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:31:07,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:31:07,772 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:31:07,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:31:07,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:31:07,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:31:07,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:31:07,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:31:07,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:31:07,774 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:31:07,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:31:07,775 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:31:07,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:31:07,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:31:07,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:31:07,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:31:07,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:31:07,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:07,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:31:07,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:31:07,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:31:07,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:31:07,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:31:07,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:31:07,780 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:31:07,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:31:07,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:31:07,781 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:31:07,781 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_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/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_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2023-11-12 02:31:08,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:31:08,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:31:08,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:31:08,076 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:31:08,077 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:31:08,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/bitvector/byte_add-2.i [2023-11-12 02:31:11,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:31:11,430 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:31:11,431 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/sv-benchmarks/c/bitvector/byte_add-2.i [2023-11-12 02:31:11,441 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/data/cffa5a67b/d2af7f5432a94761a8713a9952222afd/FLAGc07146073 [2023-11-12 02:31:11,455 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/data/cffa5a67b/d2af7f5432a94761a8713a9952222afd [2023-11-12 02:31:11,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:31:11,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:31:11,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:11,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:31:11,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:31:11,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:11,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6425bb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11, skipping insertion in model container [2023-11-12 02:31:11,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:11,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:31:11,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:11,823 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:31:11,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:11,921 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:31:11,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11 WrapperNode [2023-11-12 02:31:11,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:11,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:11,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:31:11,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:31:11,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:11,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,020 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2023-11-12 02:31:12,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:12,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:31:12,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:31:12,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:31:12,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:31:12,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:31:12,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:31:12,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:31:12,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (1/1) ... [2023-11-12 02:31:12,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:12,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:12,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:31:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:31:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:31:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:31:12,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:31:12,244 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:31:12,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:31:12,788 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:31:12,796 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:31:12,800 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:31:12,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:12 BoogieIcfgContainer [2023-11-12 02:31:12,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:31:12,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:31:12,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:31:12,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:31:12,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:31:11" (1/3) ... [2023-11-12 02:31:12,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cc9598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:12, skipping insertion in model container [2023-11-12 02:31:12,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:11" (2/3) ... [2023-11-12 02:31:12,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cc9598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:12, skipping insertion in model container [2023-11-12 02:31:12,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:12" (3/3) ... [2023-11-12 02:31:12,817 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2023-11-12 02:31:12,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:31:12,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-12 02:31:12,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:31:12,910 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=LoopHeads, 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;@409245fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:31:12,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-12 02:31:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 87 states have (on average 1.896551724137931) internal successors, (165), 128 states have internal predecessors, (165), 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-12 02:31:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 02:31:12,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:12,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 02:31:12,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:12,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-11-12 02:31:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827987578] [2023-11-12 02:31:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:13,090 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-12 02:31:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827987578] [2023-11-12 02:31:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827987578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:13,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:31:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030843688] [2023-11-12 02:31:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:31:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:31:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:31:13,131 INFO L87 Difference]: Start difference. First operand has 129 states, 87 states have (on average 1.896551724137931) internal successors, (165), 128 states have internal predecessors, (165), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12 02:31:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:13,159 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2023-11-12 02:31:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:31:13,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-11-12 02:31:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:13,171 INFO L225 Difference]: With dead ends: 161 [2023-11-12 02:31:13,172 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 02:31:13,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:31:13,178 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:13,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:31:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 02:31:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 02:31:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 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-12 02:31:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2023-11-12 02:31:13,220 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 4 [2023-11-12 02:31:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:13,221 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2023-11-12 02:31:13,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12 02:31:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2023-11-12 02:31:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 02:31:13,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:13,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:13,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:31:13,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:13,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 295956508, now seen corresponding path program 1 times [2023-11-12 02:31:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270373124] [2023-11-12 02:31:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:13,484 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-12 02:31:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270373124] [2023-11-12 02:31:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270373124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485588243] [2023-11-12 02:31:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:13,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:13,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:13,492 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12 02:31:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:13,715 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2023-11-12 02:31:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-11-12 02:31:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:13,717 INFO L225 Difference]: With dead ends: 161 [2023-11-12 02:31:13,717 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 02:31:13,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:13,720 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:13,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 145 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 02:31:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-11-12 02:31:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 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-12 02:31:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2023-11-12 02:31:13,734 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 19 [2023-11-12 02:31:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:13,734 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2023-11-12 02:31:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12 02:31:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2023-11-12 02:31:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:31:13,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:13,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:13,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:31:13,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:13,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1601634302, now seen corresponding path program 1 times [2023-11-12 02:31:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991155864] [2023-11-12 02:31:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991155864] [2023-11-12 02:31:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991155864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207962885] [2023-11-12 02:31:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:14,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:14,035 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12 02:31:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:14,369 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2023-11-12 02:31:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:31:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-12 02:31:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:14,372 INFO L225 Difference]: With dead ends: 230 [2023-11-12 02:31:14,372 INFO L226 Difference]: Without dead ends: 175 [2023-11-12 02:31:14,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:14,374 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 114 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:14,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 199 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:31:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-12 02:31:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 127. [2023-11-12 02:31:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.373015873015873) internal successors, (173), 126 states have internal predecessors, (173), 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-12 02:31:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2023-11-12 02:31:14,392 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 26 [2023-11-12 02:31:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:14,393 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2023-11-12 02:31:14,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12 02:31:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2023-11-12 02:31:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 02:31:14,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:14,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:31:14,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:14,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1014937112, now seen corresponding path program 1 times [2023-11-12 02:31:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:14,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289220577] [2023-11-12 02:31:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:31:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289220577] [2023-11-12 02:31:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289220577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:14,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216176236] [2023-11-12 02:31:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:14,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:14,576 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 02:31:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:14,789 INFO L93 Difference]: Finished difference Result 362 states and 491 transitions. [2023-11-12 02:31:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:14,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 33 [2023-11-12 02:31:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:14,794 INFO L225 Difference]: With dead ends: 362 [2023-11-12 02:31:14,794 INFO L226 Difference]: Without dead ends: 260 [2023-11-12 02:31:14,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:14,807 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 140 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:14,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 351 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-12 02:31:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 140. [2023-11-12 02:31:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 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-12 02:31:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-11-12 02:31:14,845 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 33 [2023-11-12 02:31:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:14,846 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-11-12 02:31:14,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 02:31:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-11-12 02:31:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 02:31:14,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:14,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:14,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:31:14,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:14,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash -36396044, now seen corresponding path program 1 times [2023-11-12 02:31:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956729361] [2023-11-12 02:31:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:31:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956729361] [2023-11-12 02:31:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956729361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482479601] [2023-11-12 02:31:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:15,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:15,055 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 02:31:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:15,262 INFO L93 Difference]: Finished difference Result 368 states and 497 transitions. [2023-11-12 02:31:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2023-11-12 02:31:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:15,265 INFO L225 Difference]: With dead ends: 368 [2023-11-12 02:31:15,265 INFO L226 Difference]: Without dead ends: 266 [2023-11-12 02:31:15,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:15,267 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 129 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:15,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 341 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-12 02:31:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 153. [2023-11-12 02:31:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 152 states have internal predecessors, (203), 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-12 02:31:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 203 transitions. [2023-11-12 02:31:15,283 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 203 transitions. Word has length 36 [2023-11-12 02:31:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:15,284 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 203 transitions. [2023-11-12 02:31:15,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 02:31:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 203 transitions. [2023-11-12 02:31:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 02:31:15,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:15,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:15,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:31:15,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:15,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1620717245, now seen corresponding path program 1 times [2023-11-12 02:31:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328605565] [2023-11-12 02:31:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328605565] [2023-11-12 02:31:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328605565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502166218] [2023-11-12 02:31:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:15,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:15,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:31:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:15,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:31:15,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:31:15,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:31:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502166218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:31:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-12 02:31:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683309300] [2023-11-12 02:31:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:15,592 INFO L87 Difference]: Start difference. First operand 153 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 02:31:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:15,852 INFO L93 Difference]: Finished difference Result 306 states and 435 transitions. [2023-11-12 02:31:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2023-11-12 02:31:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:15,854 INFO L225 Difference]: With dead ends: 306 [2023-11-12 02:31:15,854 INFO L226 Difference]: Without dead ends: 206 [2023-11-12 02:31:15,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:15,856 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-12 02:31:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2023-11-12 02:31:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 183 states have internal predecessors, (240), 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-12 02:31:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2023-11-12 02:31:15,869 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 39 [2023-11-12 02:31:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:15,870 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2023-11-12 02:31:15,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 02:31:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2023-11-12 02:31:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-12 02:31:15,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:15,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:15,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:16,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:16,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:16,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 322716349, now seen corresponding path program 1 times [2023-11-12 02:31:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:16,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331611644] [2023-11-12 02:31:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:16,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331611644] [2023-11-12 02:31:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331611644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:16,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774423991] [2023-11-12 02:31:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:16,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:16,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:16,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:16,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:31:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:16,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:31:16,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:31:16,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:31:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774423991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:31:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-12 02:31:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752383651] [2023-11-12 02:31:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:16,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:16,424 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 02:31:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:16,626 INFO L93 Difference]: Finished difference Result 368 states and 503 transitions. [2023-11-12 02:31:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 46 [2023-11-12 02:31:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:16,629 INFO L225 Difference]: With dead ends: 368 [2023-11-12 02:31:16,629 INFO L226 Difference]: Without dead ends: 237 [2023-11-12 02:31:16,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:16,630 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:16,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-12 02:31:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2023-11-12 02:31:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 208 states have internal predecessors, (269), 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-12 02:31:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2023-11-12 02:31:16,650 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 46 [2023-11-12 02:31:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:16,651 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2023-11-12 02:31:16,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 02:31:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2023-11-12 02:31:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-12 02:31:16,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:16,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:16,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:16,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:16,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 759731705, now seen corresponding path program 1 times [2023-11-12 02:31:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432346051] [2023-11-12 02:31:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-12 02:31:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432346051] [2023-11-12 02:31:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432346051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:16,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:31:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024187130] [2023-11-12 02:31:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:16,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:16,973 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-12 02:31:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:16,986 INFO L93 Difference]: Finished difference Result 254 states and 324 transitions. [2023-11-12 02:31:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2023-11-12 02:31:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:16,988 INFO L225 Difference]: With dead ends: 254 [2023-11-12 02:31:16,988 INFO L226 Difference]: Without dead ends: 183 [2023-11-12 02:31:16,989 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-12 02:31:16,990 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:16,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 221 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:31:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-12 02:31:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-11-12 02:31:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 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-12 02:31:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2023-11-12 02:31:16,998 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 53 [2023-11-12 02:31:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:16,999 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2023-11-12 02:31:16,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-12 02:31:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2023-11-12 02:31:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-12 02:31:17,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:17,000 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:17,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:31:17,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:17,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1220598021, now seen corresponding path program 1 times [2023-11-12 02:31:17,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:17,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362353926] [2023-11-12 02:31:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-12 02:31:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:17,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362353926] [2023-11-12 02:31:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362353926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:31:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570253161] [2023-11-12 02:31:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:31:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:31:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:17,180 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-12 02:31:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:17,390 INFO L93 Difference]: Finished difference Result 497 states and 633 transitions. [2023-11-12 02:31:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:31:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 65 [2023-11-12 02:31:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:17,394 INFO L225 Difference]: With dead ends: 497 [2023-11-12 02:31:17,394 INFO L226 Difference]: Without dead ends: 365 [2023-11-12 02:31:17,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:17,397 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 149 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:17,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 292 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-12 02:31:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 225. [2023-11-12 02:31:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.2767857142857142) internal successors, (286), 224 states have internal predecessors, (286), 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-12 02:31:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2023-11-12 02:31:17,411 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 65 [2023-11-12 02:31:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:17,412 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2023-11-12 02:31:17,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-12 02:31:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2023-11-12 02:31:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-12 02:31:17,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:17,418 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:17,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:31:17,418 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:17,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1267682570, now seen corresponding path program 1 times [2023-11-12 02:31:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424552754] [2023-11-12 02:31:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:31:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424552754] [2023-11-12 02:31:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424552754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356083495] [2023-11-12 02:31:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:17,607 INFO L87 Difference]: Start difference. First operand 225 states and 286 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 02:31:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:17,666 INFO L93 Difference]: Finished difference Result 507 states and 645 transitions. [2023-11-12 02:31:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 68 [2023-11-12 02:31:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:17,669 INFO L225 Difference]: With dead ends: 507 [2023-11-12 02:31:17,669 INFO L226 Difference]: Without dead ends: 333 [2023-11-12 02:31:17,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12 02:31:17,671 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 67 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:17,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 326 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:31:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-12 02:31:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 247. [2023-11-12 02:31:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 246 states have internal predecessors, (320), 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-12 02:31:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 320 transitions. [2023-11-12 02:31:17,706 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 320 transitions. Word has length 68 [2023-11-12 02:31:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:17,706 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 320 transitions. [2023-11-12 02:31:17,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 02:31:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 320 transitions. [2023-11-12 02:31:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-12 02:31:17,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:17,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:31:17,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:17,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1219048812, now seen corresponding path program 1 times [2023-11-12 02:31:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549073735] [2023-11-12 02:31:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-12 02:31:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549073735] [2023-11-12 02:31:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549073735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:31:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576413739] [2023-11-12 02:31:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:17,916 INFO L87 Difference]: Start difference. First operand 247 states and 320 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 02:31:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:18,201 INFO L93 Difference]: Finished difference Result 725 states and 940 transitions. [2023-11-12 02:31:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:31:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2023-11-12 02:31:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:18,205 INFO L225 Difference]: With dead ends: 725 [2023-11-12 02:31:18,205 INFO L226 Difference]: Without dead ends: 524 [2023-11-12 02:31:18,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:31:18,206 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 267 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:18,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 237 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2023-11-12 02:31:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 405. [2023-11-12 02:31:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 404 states have internal predecessors, (520), 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-12 02:31:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 520 transitions. [2023-11-12 02:31:18,226 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 520 transitions. Word has length 74 [2023-11-12 02:31:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:18,226 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 520 transitions. [2023-11-12 02:31:18,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 02:31:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 520 transitions. [2023-11-12 02:31:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-12 02:31:18,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:18,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:18,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:31:18,229 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:18,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1243874440, now seen corresponding path program 1 times [2023-11-12 02:31:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562658210] [2023-11-12 02:31:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-12 02:31:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562658210] [2023-11-12 02:31:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562658210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737689871] [2023-11-12 02:31:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:18,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:18,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:18,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:31:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:18,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:31:18,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:31:18,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:31:18,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737689871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:18,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:31:18,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-12 02:31:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289452553] [2023-11-12 02:31:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:18,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:18,526 INFO L87 Difference]: Start difference. First operand 405 states and 520 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 02:31:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:18,657 INFO L93 Difference]: Finished difference Result 1085 states and 1387 transitions. [2023-11-12 02:31:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2023-11-12 02:31:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:18,663 INFO L225 Difference]: With dead ends: 1085 [2023-11-12 02:31:18,663 INFO L226 Difference]: Without dead ends: 689 [2023-11-12 02:31:18,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:18,665 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 100 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:18,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 209 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:31:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-11-12 02:31:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 553. [2023-11-12 02:31:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.2771739130434783) internal successors, (705), 552 states have internal predecessors, (705), 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-12 02:31:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 705 transitions. [2023-11-12 02:31:18,697 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 705 transitions. Word has length 74 [2023-11-12 02:31:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:18,698 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 705 transitions. [2023-11-12 02:31:18,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 02:31:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 705 transitions. [2023-11-12 02:31:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-12 02:31:18,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:18,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:18,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:18,911 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:18,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1909734337, now seen corresponding path program 1 times [2023-11-12 02:31:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352648899] [2023-11-12 02:31:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-12 02:31:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352648899] [2023-11-12 02:31:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352648899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:19,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:19,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:31:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155709059] [2023-11-12 02:31:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:19,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:19,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:19,111 INFO L87 Difference]: Start difference. First operand 553 states and 705 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 02:31:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:19,446 INFO L93 Difference]: Finished difference Result 1385 states and 1753 transitions. [2023-11-12 02:31:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:31:19,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2023-11-12 02:31:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:19,452 INFO L225 Difference]: With dead ends: 1385 [2023-11-12 02:31:19,452 INFO L226 Difference]: Without dead ends: 836 [2023-11-12 02:31:19,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:31:19,454 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 319 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:19,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 230 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:31:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2023-11-12 02:31:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 694. [2023-11-12 02:31:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.2626262626262625) internal successors, (875), 693 states have internal predecessors, (875), 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-12 02:31:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 875 transitions. [2023-11-12 02:31:19,490 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 875 transitions. Word has length 74 [2023-11-12 02:31:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:19,492 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 875 transitions. [2023-11-12 02:31:19,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 02:31:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 875 transitions. [2023-11-12 02:31:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-12 02:31:19,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:19,494 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:19,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:31:19,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:19,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1195193234, now seen corresponding path program 1 times [2023-11-12 02:31:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757489080] [2023-11-12 02:31:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-12 02:31:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757489080] [2023-11-12 02:31:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757489080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:31:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207568849] [2023-11-12 02:31:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:19,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:19,725 INFO L87 Difference]: Start difference. First operand 694 states and 875 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 02:31:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:20,199 INFO L93 Difference]: Finished difference Result 1776 states and 2225 transitions. [2023-11-12 02:31:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:31:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 80 [2023-11-12 02:31:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:20,205 INFO L225 Difference]: With dead ends: 1776 [2023-11-12 02:31:20,206 INFO L226 Difference]: Without dead ends: 1008 [2023-11-12 02:31:20,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:31:20,208 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 298 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:20,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 311 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:31:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-11-12 02:31:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 824. [2023-11-12 02:31:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.2648845686512757) internal successors, (1041), 823 states have internal predecessors, (1041), 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-12 02:31:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1041 transitions. [2023-11-12 02:31:20,253 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1041 transitions. Word has length 80 [2023-11-12 02:31:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:20,254 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1041 transitions. [2023-11-12 02:31:20,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 02:31:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1041 transitions. [2023-11-12 02:31:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-12 02:31:20,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:20,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:20,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:31:20,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:20,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 345497436, now seen corresponding path program 1 times [2023-11-12 02:31:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092192695] [2023-11-12 02:31:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:31:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092192695] [2023-11-12 02:31:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092192695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824320777] [2023-11-12 02:31:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:20,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:20,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:31:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:20,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:31:20,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 02:31:20,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:31:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824320777] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:20,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-12 02:31:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857398524] [2023-11-12 02:31:20,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:20,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:31:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:31:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:31:20,708 INFO L87 Difference]: Start difference. First operand 824 states and 1041 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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-12 02:31:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:22,508 INFO L93 Difference]: Finished difference Result 4952 states and 6120 transitions. [2023-11-12 02:31:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-12 02:31:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 80 [2023-11-12 02:31:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:22,531 INFO L225 Difference]: With dead ends: 4952 [2023-11-12 02:31:22,531 INFO L226 Difference]: Without dead ends: 4010 [2023-11-12 02:31:22,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=531, Invalid=2225, Unknown=0, NotChecked=0, Total=2756 [2023-11-12 02:31:22,535 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 928 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:22,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1015 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:31:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2023-11-12 02:31:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 1077. [2023-11-12 02:31:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.4070631970260223) internal successors, (1514), 1076 states have internal predecessors, (1514), 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-12 02:31:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1514 transitions. [2023-11-12 02:31:22,627 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1514 transitions. Word has length 80 [2023-11-12 02:31:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:22,627 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1514 transitions. [2023-11-12 02:31:22,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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-12 02:31:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1514 transitions. [2023-11-12 02:31:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-12 02:31:22,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:22,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:22,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:22,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:22,836 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:22,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash 597160707, now seen corresponding path program 1 times [2023-11-12 02:31:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:22,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318388028] [2023-11-12 02:31:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:31:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318388028] [2023-11-12 02:31:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318388028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:31:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770431616] [2023-11-12 02:31:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:23,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:23,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:23,041 INFO L87 Difference]: Start difference. First operand 1077 states and 1514 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12 02:31:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:23,525 INFO L93 Difference]: Finished difference Result 2470 states and 3454 transitions. [2023-11-12 02:31:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:31:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 80 [2023-11-12 02:31:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:23,533 INFO L225 Difference]: With dead ends: 2470 [2023-11-12 02:31:23,534 INFO L226 Difference]: Without dead ends: 1378 [2023-11-12 02:31:23,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:31:23,536 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 292 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:23,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 345 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:31:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-12 02:31:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1237. [2023-11-12 02:31:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-12 02:31:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-12 02:31:23,611 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 80 [2023-11-12 02:31:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:23,611 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-12 02:31:23,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12 02:31:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-12 02:31:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-12 02:31:23,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:23,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:23,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:31:23,615 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:23,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1385301662, now seen corresponding path program 1 times [2023-11-12 02:31:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343915884] [2023-11-12 02:31:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-12 02:31:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343915884] [2023-11-12 02:31:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343915884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:31:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948428059] [2023-11-12 02:31:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:31:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:31:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:23,872 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 02:31:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:24,293 INFO L93 Difference]: Finished difference Result 3874 states and 5448 transitions. [2023-11-12 02:31:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:31:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 86 [2023-11-12 02:31:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:24,315 INFO L225 Difference]: With dead ends: 3874 [2023-11-12 02:31:24,315 INFO L226 Difference]: Without dead ends: 3689 [2023-11-12 02:31:24,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:24,317 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 271 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:24,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2023-11-12 02:31:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 1237. [2023-11-12 02:31:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-12 02:31:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-12 02:31:24,440 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 86 [2023-11-12 02:31:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:24,440 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-12 02:31:24,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 02:31:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-12 02:31:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-12 02:31:24,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:24,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:24,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:31:24,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:24,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash 976764151, now seen corresponding path program 1 times [2023-11-12 02:31:24,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474959289] [2023-11-12 02:31:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-12 02:31:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474959289] [2023-11-12 02:31:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474959289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:31:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769771584] [2023-11-12 02:31:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:24,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:31:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:31:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:24,654 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-12 02:31:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:25,129 INFO L93 Difference]: Finished difference Result 3866 states and 5436 transitions. [2023-11-12 02:31:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:31:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2023-11-12 02:31:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:25,151 INFO L225 Difference]: With dead ends: 3866 [2023-11-12 02:31:25,152 INFO L226 Difference]: Without dead ends: 3672 [2023-11-12 02:31:25,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:25,154 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 233 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:25,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 468 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:31:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2023-11-12 02:31:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 1237. [2023-11-12 02:31:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-12 02:31:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-12 02:31:25,287 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 86 [2023-11-12 02:31:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:25,288 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-12 02:31:25,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-12 02:31:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-12 02:31:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:31:25,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:25,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:31:25,294 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:25,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2065857063, now seen corresponding path program 1 times [2023-11-12 02:31:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220258793] [2023-11-12 02:31:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-12 02:31:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:25,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220258793] [2023-11-12 02:31:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220258793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:31:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669178534] [2023-11-12 02:31:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:25,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:25,583 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-12 02:31:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:26,288 INFO L93 Difference]: Finished difference Result 5108 states and 7184 transitions. [2023-11-12 02:31:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:31:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 89 [2023-11-12 02:31:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:26,317 INFO L225 Difference]: With dead ends: 5108 [2023-11-12 02:31:26,317 INFO L226 Difference]: Without dead ends: 4923 [2023-11-12 02:31:26,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:31:26,320 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 407 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:26,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 884 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:31:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4923 states. [2023-11-12 02:31:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4923 to 1237. [2023-11-12 02:31:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-12 02:31:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-12 02:31:26,508 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 89 [2023-11-12 02:31:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:26,508 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-12 02:31:26,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-12 02:31:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-12 02:31:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:31:26,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:26,511 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:26,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:31:26,511 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:26,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2070259415, now seen corresponding path program 1 times [2023-11-12 02:31:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552709401] [2023-11-12 02:31:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-12 02:31:26,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552709401] [2023-11-12 02:31:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552709401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:26,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:26,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:31:26,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484471951] [2023-11-12 02:31:26,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:26,735 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-12 02:31:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:27,450 INFO L93 Difference]: Finished difference Result 5090 states and 7159 transitions. [2023-11-12 02:31:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:31:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 89 [2023-11-12 02:31:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:27,493 INFO L225 Difference]: With dead ends: 5090 [2023-11-12 02:31:27,493 INFO L226 Difference]: Without dead ends: 4896 [2023-11-12 02:31:27,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:31:27,496 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 349 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:27,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 782 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:31:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2023-11-12 02:31:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 1237. [2023-11-12 02:31:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-12 02:31:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-12 02:31:27,650 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 89 [2023-11-12 02:31:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:27,650 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-12 02:31:27,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-12 02:31:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-12 02:31:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:31:27,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:27,653 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:27,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 02:31:27,654 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:27,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash -131012616, now seen corresponding path program 1 times [2023-11-12 02:31:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38397316] [2023-11-12 02:31:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-12 02:31:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38397316] [2023-11-12 02:31:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38397316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056954987] [2023-11-12 02:31:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:27,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:27,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:27,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:27,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:31:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:27,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:31:27,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-12 02:31:28,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-12 02:31:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056954987] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:28,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:28,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-11-12 02:31:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247685930] [2023-11-12 02:31:28,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:28,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:31:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:28,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:31:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:31:28,177 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-12 02:31:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:29,520 INFO L93 Difference]: Finished difference Result 4766 states and 6974 transitions. [2023-11-12 02:31:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-12 02:31:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 89 [2023-11-12 02:31:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:29,528 INFO L225 Difference]: With dead ends: 4766 [2023-11-12 02:31:29,529 INFO L226 Difference]: Without dead ends: 3546 [2023-11-12 02:31:29,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-11-12 02:31:29,532 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 569 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:29,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 638 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:31:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2023-11-12 02:31:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 2695. [2023-11-12 02:31:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.3173719376391981) internal successors, (3549), 2694 states have internal predecessors, (3549), 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-12 02:31:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3549 transitions. [2023-11-12 02:31:29,840 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3549 transitions. Word has length 89 [2023-11-12 02:31:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:29,840 INFO L495 AbstractCegarLoop]: Abstraction has 2695 states and 3549 transitions. [2023-11-12 02:31:29,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-12 02:31:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3549 transitions. [2023-11-12 02:31:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:31:29,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:29,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:29,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:30,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:30,050 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:30,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 939921604, now seen corresponding path program 1 times [2023-11-12 02:31:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266544550] [2023-11-12 02:31:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-12 02:31:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266544550] [2023-11-12 02:31:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266544550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446361059] [2023-11-12 02:31:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:30,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:30,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:30,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 02:31:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:30,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:31:30,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-12 02:31:30,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:31:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446361059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:31:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-12 02:31:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670573197] [2023-11-12 02:31:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:30,434 INFO L87 Difference]: Start difference. First operand 2695 states and 3549 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12 02:31:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:30,978 INFO L93 Difference]: Finished difference Result 5711 states and 7503 transitions. [2023-11-12 02:31:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:30,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 89 [2023-11-12 02:31:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:30,988 INFO L225 Difference]: With dead ends: 5711 [2023-11-12 02:31:30,988 INFO L226 Difference]: Without dead ends: 5264 [2023-11-12 02:31:30,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:30,992 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 66 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:30,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 230 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:31:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2023-11-12 02:31:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4331. [2023-11-12 02:31:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 4330 states have (on average 1.3207852193995382) internal successors, (5719), 4330 states have internal predecessors, (5719), 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-12 02:31:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 5719 transitions. [2023-11-12 02:31:31,431 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 5719 transitions. Word has length 89 [2023-11-12 02:31:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:31,432 INFO L495 AbstractCegarLoop]: Abstraction has 4331 states and 5719 transitions. [2023-11-12 02:31:31,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12 02:31:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 5719 transitions. [2023-11-12 02:31:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:31:31,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:31,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:31,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-12 02:31:31,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:31,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1890652725, now seen corresponding path program 1 times [2023-11-12 02:31:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662616599] [2023-11-12 02:31:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-12 02:31:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662616599] [2023-11-12 02:31:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662616599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:31,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:31,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:31:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375873994] [2023-11-12 02:31:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:31,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:31,960 INFO L87 Difference]: Start difference. First operand 4331 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-12 02:31:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:33,439 INFO L93 Difference]: Finished difference Result 9902 states and 13118 transitions. [2023-11-12 02:31:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:31:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 91 [2023-11-12 02:31:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:33,462 INFO L225 Difference]: With dead ends: 9902 [2023-11-12 02:31:33,462 INFO L226 Difference]: Without dead ends: 9662 [2023-11-12 02:31:33,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:31:33,467 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 513 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:33,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1256 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:31:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2023-11-12 02:31:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 4310. [2023-11-12 02:31:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4309 states have (on average 1.3209561383151542) internal successors, (5692), 4309 states have internal predecessors, (5692), 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-12 02:31:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 5692 transitions. [2023-11-12 02:31:34,068 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 5692 transitions. Word has length 91 [2023-11-12 02:31:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:34,068 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 5692 transitions. [2023-11-12 02:31:34,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-12 02:31:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 5692 transitions. [2023-11-12 02:31:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:31:34,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:34,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:34,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-12 02:31:34,074 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:34,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1394697509, now seen corresponding path program 1 times [2023-11-12 02:31:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938829174] [2023-11-12 02:31:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-12 02:31:34,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938829174] [2023-11-12 02:31:34,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938829174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:31:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077296456] [2023-11-12 02:31:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:34,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:34,379 INFO L87 Difference]: Start difference. First operand 4310 states and 5692 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-12 02:31:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:35,913 INFO L93 Difference]: Finished difference Result 11022 states and 14449 transitions. [2023-11-12 02:31:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:31:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 91 [2023-11-12 02:31:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:35,938 INFO L225 Difference]: With dead ends: 11022 [2023-11-12 02:31:35,938 INFO L226 Difference]: Without dead ends: 10631 [2023-11-12 02:31:35,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:31:35,944 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 427 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:35,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1085 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:31:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10631 states. [2023-11-12 02:31:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10631 to 4298. [2023-11-12 02:31:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4297 states have (on average 1.3218524552013033) internal successors, (5680), 4297 states have internal predecessors, (5680), 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-12 02:31:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5680 transitions. [2023-11-12 02:31:36,665 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5680 transitions. Word has length 91 [2023-11-12 02:31:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:36,666 INFO L495 AbstractCegarLoop]: Abstraction has 4298 states and 5680 transitions. [2023-11-12 02:31:36,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-12 02:31:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5680 transitions. [2023-11-12 02:31:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-12 02:31:36,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:36,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:36,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-12 02:31:36,672 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:36,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 397319621, now seen corresponding path program 1 times [2023-11-12 02:31:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673107413] [2023-11-12 02:31:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:31:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673107413] [2023-11-12 02:31:36,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673107413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:36,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236614855] [2023-11-12 02:31:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:36,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:36,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:36,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 02:31:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:37,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:31:37,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-12 02:31:37,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:31:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236614855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:37,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-11-12 02:31:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161461978] [2023-11-12 02:31:37,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:37,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:31:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:31:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:31:37,583 INFO L87 Difference]: Start difference. First operand 4298 states and 5680 transitions. Second operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 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-12 02:31:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:39,349 INFO L93 Difference]: Finished difference Result 12377 states and 16220 transitions. [2023-11-12 02:31:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:31:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 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 92 [2023-11-12 02:31:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:39,366 INFO L225 Difference]: With dead ends: 12377 [2023-11-12 02:31:39,366 INFO L226 Difference]: Without dead ends: 7171 [2023-11-12 02:31:39,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:31:39,374 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 754 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:39,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 749 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:31:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2023-11-12 02:31:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 5734. [2023-11-12 02:31:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 5733 states have (on average 1.281004709576138) internal successors, (7344), 5733 states have internal predecessors, (7344), 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-12 02:31:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 7344 transitions. [2023-11-12 02:31:40,136 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 7344 transitions. Word has length 92 [2023-11-12 02:31:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:40,136 INFO L495 AbstractCegarLoop]: Abstraction has 5734 states and 7344 transitions. [2023-11-12 02:31:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 15 states have internal predecessors, (146), 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-12 02:31:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 7344 transitions. [2023-11-12 02:31:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-12 02:31:40,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:40,142 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:40,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:40,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:40,363 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:40,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -709908213, now seen corresponding path program 1 times [2023-11-12 02:31:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626674947] [2023-11-12 02:31:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-12 02:31:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626674947] [2023-11-12 02:31:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626674947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070982502] [2023-11-12 02:31:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:40,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:40,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 02:31:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:40,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 02:31:40,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-12 02:31:41,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-12 02:31:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070982502] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:41,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2023-11-12 02:31:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377584664] [2023-11-12 02:31:41,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:41,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:31:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:31:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:31:41,384 INFO L87 Difference]: Start difference. First operand 5734 states and 7344 transitions. Second operand has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 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-12 02:31:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:44,325 INFO L93 Difference]: Finished difference Result 16585 states and 21399 transitions. [2023-11-12 02:31:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:31:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 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 95 [2023-11-12 02:31:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:31:44,371 INFO L225 Difference]: With dead ends: 16585 [2023-11-12 02:31:44,372 INFO L226 Difference]: Without dead ends: 12331 [2023-11-12 02:31:44,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2023-11-12 02:31:44,380 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 1084 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:31:44,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1263 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:31:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2023-11-12 02:31:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 5752. [2023-11-12 02:31:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 5751 states have (on average 1.276299773952356) internal successors, (7340), 5751 states have internal predecessors, (7340), 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-12 02:31:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 7340 transitions. [2023-11-12 02:31:45,215 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 7340 transitions. Word has length 95 [2023-11-12 02:31:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:31:45,216 INFO L495 AbstractCegarLoop]: Abstraction has 5752 states and 7340 transitions. [2023-11-12 02:31:45,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 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-12 02:31:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 7340 transitions. [2023-11-12 02:31:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-12 02:31:45,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:31:45,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:45,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:45,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:45,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:31:45,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1114079335, now seen corresponding path program 1 times [2023-11-12 02:31:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975073891] [2023-11-12 02:31:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:45,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:45,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:45,662 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:31:45,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-12 02:31:45,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-12 02:31:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-12 02:31:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-12 02:31:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-12 02:31:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-12 02:31:45,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-12 02:31:45,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-12 02:31:45,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-12 02:31:45,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-12 02:31:45,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-12 02:31:45,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-12 02:31:45,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-12 02:31:45,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-12 02:31:45,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-12 02:31:45,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-12 02:31:45,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-12 02:31:45,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-12 02:31:45,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-12 02:31:45,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-12 02:31:45,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-12 02:31:45,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-12 02:31:45,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-12 02:31:45,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-12 02:31:45,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-12 02:31:45,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-12 02:31:45,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-12 02:31:45,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-12 02:31:45,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-12 02:31:45,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-12 02:31:45,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-12 02:31:45,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-12 02:31:45,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-12 02:31:45,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-12 02:31:45,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-12 02:31:45,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-12 02:31:45,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-12 02:31:45,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-12 02:31:45,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-12 02:31:45,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-12 02:31:45,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-12 02:31:45,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-12 02:31:45,682 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:45,688 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:31:45,799 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,803 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,804 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,804 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:31:45,804 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:31:45,805 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:31:45 BoogieIcfgContainer [2023-11-12 02:31:45,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:31:45,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:31:45,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:31:45,838 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:31:45,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:12" (3/4) ... [2023-11-12 02:31:45,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:31:45,881 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,881 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,881 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:31:45,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:31:45,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:31:45,967 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:31:45,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:31:45,968 INFO L158 Benchmark]: Toolchain (without parser) took 34508.18ms. Allocated memory was 136.3MB in the beginning and 767.6MB in the end (delta: 631.2MB). Free memory was 93.9MB in the beginning and 335.1MB in the end (delta: -241.2MB). Peak memory consumption was 391.3MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,968 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 107.0MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:31:45,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.71ms. Allocated memory is still 136.3MB. Free memory was 93.5MB in the beginning and 80.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.64ms. Allocated memory is still 136.3MB. Free memory was 80.5MB in the beginning and 76.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,970 INFO L158 Benchmark]: Boogie Preprocessor took 46.27ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 74.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,970 INFO L158 Benchmark]: RCFGBuilder took 735.43ms. Allocated memory is still 136.3MB. Free memory was 74.2MB in the beginning and 90.3MB in the end (delta: -16.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,973 INFO L158 Benchmark]: TraceAbstraction took 33031.17ms. Allocated memory was 136.3MB in the beginning and 767.6MB in the end (delta: 631.2MB). Free memory was 89.4MB in the beginning and 342.4MB in the end (delta: -253.0MB). Peak memory consumption was 379.0MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,974 INFO L158 Benchmark]: Witness Printer took 129.24ms. Allocated memory is still 767.6MB. Free memory was 342.4MB in the beginning and 335.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:31:45,984 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.29ms. Allocated memory is still 107.0MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.71ms. Allocated memory is still 136.3MB. Free memory was 93.5MB in the beginning and 80.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.64ms. Allocated memory is still 136.3MB. Free memory was 80.5MB in the beginning and 76.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.27ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 74.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 735.43ms. Allocated memory is still 136.3MB. Free memory was 74.2MB in the beginning and 90.3MB in the end (delta: -16.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33031.17ms. Allocated memory was 136.3MB in the beginning and 767.6MB in the end (delta: 631.2MB). Free memory was 89.4MB in the beginning and 342.4MB in the end (delta: -253.0MB). Peak memory consumption was 379.0MB. Max. memory is 16.1GB. * Witness Printer took 129.24ms. Allocated memory is still 767.6MB. Free memory was 342.4MB in the beginning and 335.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r1 << 8U VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r2 << 16U VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=255, \old(b)=2147483393, a0=4294967551, a1=0, a2=0, a3=0, a=255, b0=-2147483903, b1=8388607, b2=32767, b3=127, b=2147483393, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7615 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7615 mSDsluCounter, 12697 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9197 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7244 IncrementalHoareTripleChecker+Invalid, 7752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 3500 mSDtfsCounter, 7244 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1286 GetRequests, 1048 SyntacticMatches, 8 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5752occurred in iteration=26, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 37933 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2449 NumberOfCodeBlocks, 2449 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 8009 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 38 InterpolantComputations, 22 PerfectInterpolantSequences, 2246/2399 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:31:46,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf71a72-4867-471a-ab74-895c199e7605/bin/uautomizer-verify-uTZkv6EMXl/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)