./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-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_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/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_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/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_96404f0c-4541-4f10-a199-50e565a41475/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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:08,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:08,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-12 02:14:08,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:08,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:08,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:08,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:08,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:08,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:08,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:08,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:08,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:08,768 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:08,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:08,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:14:08,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:08,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:08,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:08,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:08,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:14:08,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:08,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:14:08,775 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:14:08,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:14:08,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:08,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:14:08,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:08,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:08,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:08,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:08,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:08,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:08,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:08,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:14:08,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:14:08,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:14:08,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:08,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:14:08,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:08,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:08,785 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:08,785 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_96404f0c-4541-4f10-a199-50e565a41475/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_96404f0c-4541-4f10-a199-50e565a41475/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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2023-11-12 02:14:09,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:09,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:09,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:09,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:09,137 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:09,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-11-12 02:14:12,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:12,836 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:12,836 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-11-12 02:14:12,848 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/data/f88207055/e41ee2e941664244a751307b4898b244/FLAGffdbd4543 [2023-11-12 02:14:12,867 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/data/f88207055/e41ee2e941664244a751307b4898b244 [2023-11-12 02:14:12,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:12,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:12,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:12,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:12,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:12,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:12" (1/1) ... [2023-11-12 02:14:12,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d89e8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:12, skipping insertion in model container [2023-11-12 02:14:12,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:12" (1/1) ... [2023-11-12 02:14:12,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:13,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:13,231 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:13,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:13,305 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:13,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13 WrapperNode [2023-11-12 02:14:13,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:13,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:13,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:13,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:13,319 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:14:13" (1/1) ... [2023-11-12 02:14:13,333 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:14:13" (1/1) ... [2023-11-12 02:14:13,400 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2023-11-12 02:14:13,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:13,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:13,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:13,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:13,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:13,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:13,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:13,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:13,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (1/1) ... [2023-11-12 02:14:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:13,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/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:14:13,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/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:14:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:14:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:13,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:13,694 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:13,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:14,573 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:14,591 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:14,591 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:14:14,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:14 BoogieIcfgContainer [2023-11-12 02:14:14,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:14,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:14,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:14,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:14,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:12" (1/3) ... [2023-11-12 02:14:14,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b95a012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:14, skipping insertion in model container [2023-11-12 02:14:14,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:13" (2/3) ... [2023-11-12 02:14:14,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b95a012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:14, skipping insertion in model container [2023-11-12 02:14:14,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:14" (3/3) ... [2023-11-12 02:14:14,617 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2023-11-12 02:14:14,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:14,648 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-12 02:14:14,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:14:14,762 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;@358e9880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:14:14,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-12 02:14:14,770 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:14:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 02:14:14,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:14,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 02:14:14,780 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:14:14,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-11-12 02:14:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:14,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301770796] [2023-11-12 02:14:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:15,048 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:14:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301770796] [2023-11-12 02:14:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301770796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:15,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:14:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335257401] [2023-11-12 02:14:15,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:15,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:14:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:14:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:14:15,114 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:14:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:15,156 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2023-11-12 02:14:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:14:15,160 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:14:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:15,173 INFO L225 Difference]: With dead ends: 161 [2023-11-12 02:14:15,174 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 02:14:15,179 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:14:15,185 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:14:15,187 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:14:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 02:14:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 02:14:15,240 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:14:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2023-11-12 02:14:15,247 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 4 [2023-11-12 02:14:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:15,248 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2023-11-12 02:14:15,248 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:14:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2023-11-12 02:14:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 02:14:15,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:15,253 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:14:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:14:15,254 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:14:15,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 295956508, now seen corresponding path program 1 times [2023-11-12 02:14:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985574899] [2023-11-12 02:14:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:15,571 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:14:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985574899] [2023-11-12 02:14:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985574899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:14:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423242132] [2023-11-12 02:14:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:15,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:14:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:14:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:14:15,579 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:14:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:15,793 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2023-11-12 02:14:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:14:15,794 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:14:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:15,796 INFO L225 Difference]: With dead ends: 161 [2023-11-12 02:14:15,796 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 02:14:15,797 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:14:15,798 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:14:15,799 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:14:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 02:14:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-11-12 02:14:15,813 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:14:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2023-11-12 02:14:15,816 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 19 [2023-11-12 02:14:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:15,817 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2023-11-12 02:14:15,817 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:14:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2023-11-12 02:14:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:14:15,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:15,823 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:14:15,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:14:15,824 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:14:15,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1601634302, now seen corresponding path program 1 times [2023-11-12 02:14:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143531578] [2023-11-12 02:14:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:16,073 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:14:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143531578] [2023-11-12 02:14:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143531578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:16,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425463766] [2023-11-12 02:14:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:16,079 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:14:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:16,420 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2023-11-12 02:14:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:14:16,421 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:14:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:16,423 INFO L225 Difference]: With dead ends: 230 [2023-11-12 02:14:16,423 INFO L226 Difference]: Without dead ends: 175 [2023-11-12 02:14:16,424 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:14:16,426 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:14:16,426 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:14:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-12 02:14:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 127. [2023-11-12 02:14:16,440 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:14:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2023-11-12 02:14:16,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 26 [2023-11-12 02:14:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:16,443 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2023-11-12 02:14:16,443 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:14:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2023-11-12 02:14:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 02:14:16,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:16,445 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:14:16,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:14:16,446 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:14:16,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1014937112, now seen corresponding path program 1 times [2023-11-12 02:14:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380499718] [2023-11-12 02:14:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:16,606 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:14:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380499718] [2023-11-12 02:14:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380499718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628091055] [2023-11-12 02:14:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:16,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:16,610 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:14:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:16,876 INFO L93 Difference]: Finished difference Result 362 states and 491 transitions. [2023-11-12 02:14:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:16,877 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:14:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:16,879 INFO L225 Difference]: With dead ends: 362 [2023-11-12 02:14:16,879 INFO L226 Difference]: Without dead ends: 260 [2023-11-12 02:14:16,880 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:14:16,882 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 140 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:14:16,882 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:14:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-12 02:14:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 140. [2023-11-12 02:14:16,897 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:14:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-11-12 02:14:16,899 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 33 [2023-11-12 02:14:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:16,899 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-11-12 02:14:16,899 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:14:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-11-12 02:14:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 02:14:16,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:16,902 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:14:16,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:14:16,902 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:14:16,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -36396044, now seen corresponding path program 1 times [2023-11-12 02:14:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201156208] [2023-11-12 02:14:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:17,026 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:14:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201156208] [2023-11-12 02:14:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201156208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321614926] [2023-11-12 02:14:17,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:17,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:17,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:17,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:17,029 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:14:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:17,217 INFO L93 Difference]: Finished difference Result 368 states and 497 transitions. [2023-11-12 02:14:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:17,217 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:14:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:17,219 INFO L225 Difference]: With dead ends: 368 [2023-11-12 02:14:17,219 INFO L226 Difference]: Without dead ends: 266 [2023-11-12 02:14:17,220 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:14:17,222 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:14:17,222 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:14:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-12 02:14:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 153. [2023-11-12 02:14:17,235 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:14:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 203 transitions. [2023-11-12 02:14:17,236 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 203 transitions. Word has length 36 [2023-11-12 02:14:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 203 transitions. [2023-11-12 02:14:17,237 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:14:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 203 transitions. [2023-11-12 02:14:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 02:14:17,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:17,240 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:14:17,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:14:17,240 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:14:17,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1620717245, now seen corresponding path program 1 times [2023-11-12 02:14:17,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:17,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123971426] [2023-11-12 02:14:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:17,381 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:14:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123971426] [2023-11-12 02:14:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123971426] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223019320] [2023-11-12 02:14:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:17,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:17,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:14:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:17,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:14:17,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 02:14:17,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:14:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223019320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:17,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:17,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-12 02:14:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112065400] [2023-11-12 02:14:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:17,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:14:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:14:17,586 INFO L87 Difference]: Start difference. First operand 153 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:14:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:17,895 INFO L93 Difference]: Finished difference Result 584 states and 813 transitions. [2023-11-12 02:14:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:14:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:14:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:17,899 INFO L225 Difference]: With dead ends: 584 [2023-11-12 02:14:17,899 INFO L226 Difference]: Without dead ends: 467 [2023-11-12 02:14:17,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:14:17,901 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 280 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:17,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 626 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:14:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-12 02:14:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 257. [2023-11-12 02:14:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.33984375) internal successors, (343), 256 states have internal predecessors, (343), 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:14:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2023-11-12 02:14:17,930 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 39 [2023-11-12 02:14:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:17,930 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2023-11-12 02:14:17,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:14:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2023-11-12 02:14:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-12 02:14:17,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:17,934 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, 1, 1, 1] [2023-11-12 02:14:17,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:18,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 02:14:18,144 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:14:18,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1279523034, now seen corresponding path program 1 times [2023-11-12 02:14:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081238554] [2023-11-12 02:14:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:18,257 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:14:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081238554] [2023-11-12 02:14:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081238554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938368736] [2023-11-12 02:14:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:18,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:18,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:14:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:18,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:14:18,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:18,405 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:14:18,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:14:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938368736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-12 02:14:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434180718] [2023-11-12 02:14:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:18,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:14:18,408 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:14:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:18,610 INFO L93 Difference]: Finished difference Result 554 states and 786 transitions. [2023-11-12 02:14:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 42 [2023-11-12 02:14:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:18,613 INFO L225 Difference]: With dead ends: 554 [2023-11-12 02:14:18,613 INFO L226 Difference]: Without dead ends: 346 [2023-11-12 02:14:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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:14:18,615 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:14:18,615 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:14:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-12 02:14:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 306. [2023-11-12 02:14:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.298360655737705) internal successors, (396), 305 states have internal predecessors, (396), 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:14:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2023-11-12 02:14:18,630 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 42 [2023-11-12 02:14:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:18,630 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2023-11-12 02:14:18,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:14:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2023-11-12 02:14:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-12 02:14:18,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:18,633 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, 1, 1, 1] [2023-11-12 02:14:18,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 02:14:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:18,839 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:14:18,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1036856780, now seen corresponding path program 1 times [2023-11-12 02:14:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824969172] [2023-11-12 02:14:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:19,060 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:14:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824969172] [2023-11-12 02:14:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824969172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766901298] [2023-11-12 02:14:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:19,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:19,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:19,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:19,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:14:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:19,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:14:19,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:19,189 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:14:19,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:14:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766901298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-12 02:14:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798303607] [2023-11-12 02:14:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:19,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:19,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:19,192 INFO L87 Difference]: Start difference. First operand 306 states and 396 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:14:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:19,424 INFO L93 Difference]: Finished difference Result 652 states and 880 transitions. [2023-11-12 02:14:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:19,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 49 [2023-11-12 02:14:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:19,428 INFO L225 Difference]: With dead ends: 652 [2023-11-12 02:14:19,428 INFO L226 Difference]: Without dead ends: 407 [2023-11-12 02:14:19,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 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:14:19,430 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:14:19,430 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:14:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-12 02:14:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 349. [2023-11-12 02:14:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.2844827586206897) internal successors, (447), 348 states have internal predecessors, (447), 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:14:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2023-11-12 02:14:19,445 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 49 [2023-11-12 02:14:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:19,446 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2023-11-12 02:14:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:14:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2023-11-12 02:14:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-12 02:14:19,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:19,448 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, 1, 1, 1] [2023-11-12 02:14:19,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:19,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:19,655 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:14:19,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -280034654, now seen corresponding path program 1 times [2023-11-12 02:14:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409707567] [2023-11-12 02:14:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:19,776 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:14:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409707567] [2023-11-12 02:14:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409707567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:14:19,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136939451] [2023-11-12 02:14:19,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:19,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:14:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:14:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:14:19,782 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:14:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:19,801 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2023-11-12 02:14:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:14:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 56 [2023-11-12 02:14:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:19,809 INFO L225 Difference]: With dead ends: 394 [2023-11-12 02:14:19,809 INFO L226 Difference]: Without dead ends: 321 [2023-11-12 02:14:19,810 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:14:19,813 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:14:19,813 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:14:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-12 02:14:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2023-11-12 02:14:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.2721518987341771) internal successors, (402), 316 states have internal predecessors, (402), 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:14:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 402 transitions. [2023-11-12 02:14:19,826 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 402 transitions. Word has length 56 [2023-11-12 02:14:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:19,826 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 402 transitions. [2023-11-12 02:14:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:14:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 402 transitions. [2023-11-12 02:14:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-12 02:14:19,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:19,828 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, 1, 1, 1] [2023-11-12 02:14:19,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:14:19,829 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:14:19,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash -318468050, now seen corresponding path program 1 times [2023-11-12 02:14:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036823866] [2023-11-12 02:14:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:20,027 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:14:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036823866] [2023-11-12 02:14:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036823866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:14:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771310423] [2023-11-12 02:14:20,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:20,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:14:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:20,030 INFO L87 Difference]: Start difference. First operand 317 states and 402 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:14:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:20,279 INFO L93 Difference]: Finished difference Result 912 states and 1149 transitions. [2023-11-12 02:14:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:14:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:14:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:20,283 INFO L225 Difference]: With dead ends: 912 [2023-11-12 02:14:20,284 INFO L226 Difference]: Without dead ends: 653 [2023-11-12 02:14:20,284 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:14:20,285 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 162 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:20,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 239 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:14:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-11-12 02:14:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2023-11-12 02:14:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.2632911392405064) internal successors, (499), 395 states have internal predecessors, (499), 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:14:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 499 transitions. [2023-11-12 02:14:20,304 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 499 transitions. Word has length 68 [2023-11-12 02:14:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 499 transitions. [2023-11-12 02:14:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:14:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 499 transitions. [2023-11-12 02:14:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-12 02:14:20,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:20,306 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, 1, 1, 1] [2023-11-12 02:14:20,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:14:20,307 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:14:20,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash -273753791, now seen corresponding path program 1 times [2023-11-12 02:14:20,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:20,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550991640] [2023-11-12 02:14:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:20,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:20,438 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:14:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550991640] [2023-11-12 02:14:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550991640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:20,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322308656] [2023-11-12 02:14:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:20,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:20,442 INFO L87 Difference]: Start difference. First operand 396 states and 499 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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:14:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:20,515 INFO L93 Difference]: Finished difference Result 934 states and 1180 transitions. [2023-11-12 02:14:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 71 [2023-11-12 02:14:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:20,519 INFO L225 Difference]: With dead ends: 934 [2023-11-12 02:14:20,520 INFO L226 Difference]: Without dead ends: 597 [2023-11-12 02:14:20,520 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:14:20,521 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:20,522 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.1s Time] [2023-11-12 02:14:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-11-12 02:14:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 441. [2023-11-12 02:14:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.2931818181818182) internal successors, (569), 440 states have internal predecessors, (569), 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:14:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 569 transitions. [2023-11-12 02:14:20,540 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 569 transitions. Word has length 71 [2023-11-12 02:14:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:20,541 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 569 transitions. [2023-11-12 02:14:20,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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:14:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 569 transitions. [2023-11-12 02:14:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-12 02:14:20,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:20,543 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, 1, 1, 1] [2023-11-12 02:14:20,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:14:20,544 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:14:20,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -837545589, now seen corresponding path program 1 times [2023-11-12 02:14:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153385113] [2023-11-12 02:14:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:20,733 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:14:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153385113] [2023-11-12 02:14:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153385113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:14:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84921643] [2023-11-12 02:14:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:20,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:14:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:14:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:14:20,737 INFO L87 Difference]: Start difference. First operand 441 states and 569 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:14:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:21,088 INFO L93 Difference]: Finished difference Result 1353 states and 1743 transitions. [2023-11-12 02:14:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:14:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 77 [2023-11-12 02:14:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:21,094 INFO L225 Difference]: With dead ends: 1353 [2023-11-12 02:14:21,095 INFO L226 Difference]: Without dead ends: 961 [2023-11-12 02:14:21,096 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:14:21,096 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 203 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:21,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 327 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:14:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2023-11-12 02:14:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 762. [2023-11-12 02:14:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 761 states have (on average 1.2746386333771353) internal successors, (970), 761 states have internal predecessors, (970), 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:14:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 970 transitions. [2023-11-12 02:14:21,132 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 970 transitions. Word has length 77 [2023-11-12 02:14:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:21,133 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 970 transitions. [2023-11-12 02:14:21,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:14:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 970 transitions. [2023-11-12 02:14:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-12 02:14:21,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:21,136 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, 1, 1, 1] [2023-11-12 02:14:21,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:14:21,136 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:14:21,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -862371217, now seen corresponding path program 1 times [2023-11-12 02:14:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125611909] [2023-11-12 02:14:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:21,244 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:14:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125611909] [2023-11-12 02:14:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125611909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757962451] [2023-11-12 02:14:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:21,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:21,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:21,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:14:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:21,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:14:21,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:21,427 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:14:21,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:14:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757962451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-12 02:14:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516217520] [2023-11-12 02:14:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:21,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:21,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:21,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:21,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:21,430 INFO L87 Difference]: Start difference. First operand 762 states and 970 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:14:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:21,584 INFO L93 Difference]: Finished difference Result 1525 states and 1932 transitions. [2023-11-12 02:14:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 77 [2023-11-12 02:14:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:21,591 INFO L225 Difference]: With dead ends: 1525 [2023-11-12 02:14:21,592 INFO L226 Difference]: Without dead ends: 1109 [2023-11-12 02:14:21,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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:14:21,593 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:21,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 217 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:14:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-11-12 02:14:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 915. [2023-11-12 02:14:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.2702407002188183) internal successors, (1161), 914 states have internal predecessors, (1161), 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:14:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1161 transitions. [2023-11-12 02:14:21,635 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1161 transitions. Word has length 77 [2023-11-12 02:14:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:21,636 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 1161 transitions. [2023-11-12 02:14:21,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:14:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1161 transitions. [2023-11-12 02:14:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-12 02:14:21,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:21,639 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:21,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:21,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:21,845 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:14:21,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1247029490, now seen corresponding path program 1 times [2023-11-12 02:14:21,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:21,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884448006] [2023-11-12 02:14:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,041 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:14:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884448006] [2023-11-12 02:14:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884448006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:22,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:22,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:14:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787965246] [2023-11-12 02:14:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:22,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:14:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:14:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:14:22,044 INFO L87 Difference]: Start difference. First operand 915 states and 1161 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:14:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:22,412 INFO L93 Difference]: Finished difference Result 1847 states and 2324 transitions. [2023-11-12 02:14:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:14:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:14:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:22,420 INFO L225 Difference]: With dead ends: 1847 [2023-11-12 02:14:22,421 INFO L226 Difference]: Without dead ends: 1273 [2023-11-12 02:14:22,422 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:14:22,423 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 218 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:22,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 314 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:14:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2023-11-12 02:14:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1063. [2023-11-12 02:14:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2608286252354048) internal successors, (1339), 1062 states have internal predecessors, (1339), 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:14:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1339 transitions. [2023-11-12 02:14:22,473 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1339 transitions. Word has length 80 [2023-11-12 02:14:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:22,473 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1339 transitions. [2023-11-12 02:14:22,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:14:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1339 transitions. [2023-11-12 02:14:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-12 02:14:22,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:22,476 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:14:22,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:14:22,477 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:14:22,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1935932099, now seen corresponding path program 1 times [2023-11-12 02:14:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708274042] [2023-11-12 02:14:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,665 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:14:22,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708274042] [2023-11-12 02:14:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708274042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442024493] [2023-11-12 02:14:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:22,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:22,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:22,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:14:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:14:22,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 02:14:22,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:22,926 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:14:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442024493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:22,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-12 02:14:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976789285] [2023-11-12 02:14:22,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:22,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:14:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:14:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:14:22,929 INFO L87 Difference]: Start difference. First operand 1063 states and 1339 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:14:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:24,758 INFO L93 Difference]: Finished difference Result 6187 states and 7465 transitions. [2023-11-12 02:14:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-12 02:14:24,759 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:14:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:24,784 INFO L225 Difference]: With dead ends: 6187 [2023-11-12 02:14:24,784 INFO L226 Difference]: Without dead ends: 5002 [2023-11-12 02:14:24,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=531, Invalid=2225, Unknown=0, NotChecked=0, Total=2756 [2023-11-12 02:14:24,792 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 922 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:24,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1025 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:14:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2023-11-12 02:14:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 1313. [2023-11-12 02:14:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 1.3330792682926829) internal successors, (1749), 1312 states have internal predecessors, (1749), 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:14:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1749 transitions. [2023-11-12 02:14:24,908 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1749 transitions. Word has length 80 [2023-11-12 02:14:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:24,908 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 1749 transitions. [2023-11-12 02:14:24,909 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:14:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1749 transitions. [2023-11-12 02:14:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-12 02:14:24,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:24,911 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, 1, 1, 1] [2023-11-12 02:14:24,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-12 02:14:25,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-12 02:14:25,118 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:14:25,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1701763767, now seen corresponding path program 1 times [2023-11-12 02:14:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84430432] [2023-11-12 02:14:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:25,404 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:14:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84430432] [2023-11-12 02:14:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84430432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:14:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845298009] [2023-11-12 02:14:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:25,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:14:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:14:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:25,408 INFO L87 Difference]: Start difference. First operand 1313 states and 1749 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:14:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:25,909 INFO L93 Difference]: Finished difference Result 3275 states and 4348 transitions. [2023-11-12 02:14:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:14:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 83 [2023-11-12 02:14:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:25,919 INFO L225 Difference]: With dead ends: 3275 [2023-11-12 02:14:25,919 INFO L226 Difference]: Without dead ends: 1898 [2023-11-12 02:14:25,921 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:14:25,922 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 332 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:25,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 314 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:14:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-11-12 02:14:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1672. [2023-11-12 02:14:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.331538001196888) internal successors, (2225), 1671 states have internal predecessors, (2225), 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:14:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2225 transitions. [2023-11-12 02:14:26,024 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2225 transitions. Word has length 83 [2023-11-12 02:14:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:26,025 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 2225 transitions. [2023-11-12 02:14:26,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:14:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2225 transitions. [2023-11-12 02:14:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-12 02:14:26,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:26,028 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:26,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:14:26,029 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:14:26,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 961486992, now seen corresponding path program 1 times [2023-11-12 02:14:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980499683] [2023-11-12 02:14:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:26,277 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:14:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980499683] [2023-11-12 02:14:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980499683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:14:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028421986] [2023-11-12 02:14:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:26,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:14:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:14:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:26,280 INFO L87 Difference]: Start difference. First operand 1672 states and 2225 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:14:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:26,824 INFO L93 Difference]: Finished difference Result 3113 states and 4124 transitions. [2023-11-12 02:14:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:14:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:14:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:26,835 INFO L225 Difference]: With dead ends: 3113 [2023-11-12 02:14:26,835 INFO L226 Difference]: Without dead ends: 2049 [2023-11-12 02:14:26,837 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:14:26,838 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 261 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:26,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 413 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:14:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2023-11-12 02:14:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1475. [2023-11-12 02:14:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.3419267299864315) internal successors, (1978), 1474 states have internal predecessors, (1978), 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:14:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1978 transitions. [2023-11-12 02:14:26,935 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1978 transitions. Word has length 86 [2023-11-12 02:14:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:26,935 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 1978 transitions. [2023-11-12 02:14:26,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:14:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1978 transitions. [2023-11-12 02:14:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-12 02:14:26,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:26,941 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:14:26,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:14:26,941 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:14:26,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 976764151, now seen corresponding path program 1 times [2023-11-12 02:14:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:26,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077324057] [2023-11-12 02:14:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:27,168 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:14:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077324057] [2023-11-12 02:14:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077324057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:27,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:14:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199186342] [2023-11-12 02:14:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:14:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:27,171 INFO L87 Difference]: Start difference. First operand 1475 states and 1978 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:14:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:27,644 INFO L93 Difference]: Finished difference Result 4597 states and 6146 transitions. [2023-11-12 02:14:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:14:27,645 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:14:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:27,668 INFO L225 Difference]: With dead ends: 4597 [2023-11-12 02:14:27,668 INFO L226 Difference]: Without dead ends: 4403 [2023-11-12 02:14:27,670 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:14:27,670 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.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:27,671 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.3s Time] [2023-11-12 02:14:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2023-11-12 02:14:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 1475. [2023-11-12 02:14:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.3419267299864315) internal successors, (1978), 1474 states have internal predecessors, (1978), 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:14:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1978 transitions. [2023-11-12 02:14:27,800 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1978 transitions. Word has length 86 [2023-11-12 02:14:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:27,800 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 1978 transitions. [2023-11-12 02:14:27,800 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:14:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1978 transitions. [2023-11-12 02:14:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:14:27,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:27,803 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:14:27,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:14:27,804 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:14:27,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2065857063, now seen corresponding path program 1 times [2023-11-12 02:14:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873130381] [2023-11-12 02:14:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-12 02:14:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873130381] [2023-11-12 02:14:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873130381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:14:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688223813] [2023-11-12 02:14:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:28,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:14:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:28,065 INFO L87 Difference]: Start difference. First operand 1475 states and 1978 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:14:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:28,318 INFO L93 Difference]: Finished difference Result 3662 states and 4693 transitions. [2023-11-12 02:14:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:14:28,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:14:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:28,330 INFO L225 Difference]: With dead ends: 3662 [2023-11-12 02:14:28,330 INFO L226 Difference]: Without dead ends: 2248 [2023-11-12 02:14:28,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:28,333 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 271 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:28,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:14:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2023-11-12 02:14:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1692. [2023-11-12 02:14:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 1.2324068598462448) internal successors, (2084), 1691 states have internal predecessors, (2084), 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:14:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2084 transitions. [2023-11-12 02:14:28,450 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2084 transitions. Word has length 89 [2023-11-12 02:14:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:28,451 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 2084 transitions. [2023-11-12 02:14:28,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:14:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2084 transitions. [2023-11-12 02:14:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:14:28,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:28,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-11-12 02:14:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:14:28,455 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:14:28,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 32056339, now seen corresponding path program 1 times [2023-11-12 02:14:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138439181] [2023-11-12 02:14:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-12 02:14:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138439181] [2023-11-12 02:14:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138439181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:28,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:14:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057554408] [2023-11-12 02:14:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:14:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:14:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:14:28,664 INFO L87 Difference]: Start difference. First operand 1692 states and 2084 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:14:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:28,722 INFO L93 Difference]: Finished difference Result 2467 states and 3029 transitions. [2023-11-12 02:14:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:14:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 89 [2023-11-12 02:14:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:28,727 INFO L225 Difference]: With dead ends: 2467 [2023-11-12 02:14:28,728 INFO L226 Difference]: Without dead ends: 778 [2023-11-12 02:14:28,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:14:28,730 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 90 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:28,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:14:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2023-11-12 02:14:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2023-11-12 02:14:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.22007722007722) internal successors, (948), 777 states have internal predecessors, (948), 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:14:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 948 transitions. [2023-11-12 02:14:28,791 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 948 transitions. Word has length 89 [2023-11-12 02:14:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:28,792 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 948 transitions. [2023-11-12 02:14:28,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:14:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 948 transitions. [2023-11-12 02:14:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:14:28,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:28,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-11-12 02:14:28,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 02:14:28,795 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:14:28,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 27653987, now seen corresponding path program 1 times [2023-11-12 02:14:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702946713] [2023-11-12 02:14:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,996 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:14:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702946713] [2023-11-12 02:14:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702946713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:28,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:14:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866752590] [2023-11-12 02:14:28,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:28,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:14:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:14:28,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:14:28,999 INFO L87 Difference]: Start difference. First operand 778 states and 948 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:14:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:29,619 INFO L93 Difference]: Finished difference Result 3324 states and 4036 transitions. [2023-11-12 02:14:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:14:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:14:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:29,636 INFO L225 Difference]: With dead ends: 3324 [2023-11-12 02:14:29,636 INFO L226 Difference]: Without dead ends: 3108 [2023-11-12 02:14:29,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:14:29,639 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 343 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:29,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 734 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:14:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2023-11-12 02:14:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 778. [2023-11-12 02:14:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.22007722007722) internal successors, (948), 777 states have internal predecessors, (948), 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:14:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 948 transitions. [2023-11-12 02:14:29,732 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 948 transitions. Word has length 89 [2023-11-12 02:14:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:29,732 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 948 transitions. [2023-11-12 02:14:29,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:14:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 948 transitions. [2023-11-12 02:14:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:14:29,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:29,735 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:14:29,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 02:14:29,735 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:14:29,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 939921604, now seen corresponding path program 1 times [2023-11-12 02:14:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387549429] [2023-11-12 02:14:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,952 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:14:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387549429] [2023-11-12 02:14:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387549429] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956691452] [2023-11-12 02:14:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:29,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:29,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:29,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 02:14:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:30,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:14:30,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:30,139 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:14:30,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:14:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956691452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:30,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-12 02:14:30,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57032771] [2023-11-12 02:14:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:30,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:30,142 INFO L87 Difference]: Start difference. First operand 778 states and 948 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:14:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:30,392 INFO L93 Difference]: Finished difference Result 1682 states and 2044 transitions. [2023-11-12 02:14:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:30,393 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:14:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:30,413 INFO L225 Difference]: With dead ends: 1682 [2023-11-12 02:14:30,417 INFO L226 Difference]: Without dead ends: 1423 [2023-11-12 02:14:30,418 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:14:30,419 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 73 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:30,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 260 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:14:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2023-11-12 02:14:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1353. [2023-11-12 02:14:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1352 states have (on average 1.2233727810650887) internal successors, (1654), 1352 states have internal predecessors, (1654), 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:14:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1654 transitions. [2023-11-12 02:14:30,541 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1654 transitions. Word has length 89 [2023-11-12 02:14:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:30,541 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1654 transitions. [2023-11-12 02:14:30,541 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:14:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1654 transitions. [2023-11-12 02:14:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:14:30,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:30,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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:14:30,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:30,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-12 02:14:30,750 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:14:30,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -802356385, now seen corresponding path program 1 times [2023-11-12 02:14:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24259748] [2023-11-12 02:14:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:14:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24259748] [2023-11-12 02:14:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24259748] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936664287] [2023-11-12 02:14:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:31,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:31,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 02:14:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:31,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 02:14:31,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-12 02:14:31,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-12 02:14:31,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936664287] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:31,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:31,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2023-11-12 02:14:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353109395] [2023-11-12 02:14:31,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:31,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 02:14:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 02:14:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:14:31,999 INFO L87 Difference]: Start difference. First operand 1353 states and 1654 transitions. Second operand has 20 states, 20 states have (on average 11.4) internal successors, (228), 20 states have internal predecessors, (228), 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:14:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:35,359 INFO L93 Difference]: Finished difference Result 4260 states and 5073 transitions. [2023-11-12 02:14:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-12 02:14:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.4) internal successors, (228), 20 states have internal predecessors, (228), 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:14:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:35,368 INFO L225 Difference]: With dead ends: 4260 [2023-11-12 02:14:35,368 INFO L226 Difference]: Without dead ends: 3945 [2023-11-12 02:14:35,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1305, Invalid=4097, Unknown=0, NotChecked=0, Total=5402 [2023-11-12 02:14:35,372 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 1634 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:35,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2699 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:14:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2023-11-12 02:14:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 1351. [2023-11-12 02:14:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.2185185185185186) internal successors, (1645), 1350 states have internal predecessors, (1645), 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:14:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1645 transitions. [2023-11-12 02:14:35,575 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1645 transitions. Word has length 91 [2023-11-12 02:14:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:35,576 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1645 transitions. [2023-11-12 02:14:35,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.4) internal successors, (228), 20 states have internal predecessors, (228), 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:14:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1645 transitions. [2023-11-12 02:14:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-12 02:14:35,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:35,579 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:14:35,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:35,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-12 02:14:35,785 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:14:35,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 397319621, now seen corresponding path program 1 times [2023-11-12 02:14:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43571831] [2023-11-12 02:14:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:36,007 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:14:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43571831] [2023-11-12 02:14:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43571831] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560120559] [2023-11-12 02:14:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:36,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:36,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:36,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:36,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 02:14:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:36,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:14:36,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:36,398 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:14:36,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:36,591 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:14:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560120559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:36,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-11-12 02:14:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600508021] [2023-11-12 02:14:36,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:36,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:14:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:14:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:14:36,597 INFO L87 Difference]: Start difference. First operand 1351 states and 1645 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:14:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:37,790 INFO L93 Difference]: Finished difference Result 3730 states and 4516 transitions. [2023-11-12 02:14:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:14:37,791 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:14:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:37,795 INFO L225 Difference]: With dead ends: 3730 [2023-11-12 02:14:37,795 INFO L226 Difference]: Without dead ends: 1866 [2023-11-12 02:14:37,798 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:14:37,799 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 767 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:37,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1039 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:14:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2023-11-12 02:14:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1368. [2023-11-12 02:14:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1367 states have (on average 1.1953182150694952) internal successors, (1634), 1367 states have internal predecessors, (1634), 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:14:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1634 transitions. [2023-11-12 02:14:37,966 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1634 transitions. Word has length 92 [2023-11-12 02:14:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:37,966 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1634 transitions. [2023-11-12 02:14:37,967 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:14:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1634 transitions. [2023-11-12 02:14:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-12 02:14:37,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:37,970 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:14:37,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:38,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-12 02:14:38,176 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:14:38,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1736938637, now seen corresponding path program 1 times [2023-11-12 02:14:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:38,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693434219] [2023-11-12 02:14:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-12 02:14:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693434219] [2023-11-12 02:14:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693434219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737094177] [2023-11-12 02:14:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:38,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:38,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-12 02:14:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:38,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 02:14:38,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:14:39,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:14:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737094177] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:39,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:39,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-11-12 02:14:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88490022] [2023-11-12 02:14:39,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:39,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 02:14:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 02:14:39,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:14:39,448 INFO L87 Difference]: Start difference. First operand 1368 states and 1634 transitions. Second operand has 18 states, 18 states have (on average 13.5) internal successors, (243), 18 states have internal predecessors, (243), 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:14:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:40,987 INFO L93 Difference]: Finished difference Result 3366 states and 3936 transitions. [2023-11-12 02:14:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 02:14:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.5) internal successors, (243), 18 states have internal predecessors, (243), 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 97 [2023-11-12 02:14:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:40,993 INFO L225 Difference]: With dead ends: 3366 [2023-11-12 02:14:40,993 INFO L226 Difference]: Without dead ends: 2706 [2023-11-12 02:14:40,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1072, Unknown=0, NotChecked=0, Total=1406 [2023-11-12 02:14:40,995 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 665 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:40,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 2194 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:14:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2023-11-12 02:14:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1594. [2023-11-12 02:14:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 1.2548650345260515) internal successors, (1999), 1593 states have internal predecessors, (1999), 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:14:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1999 transitions. [2023-11-12 02:14:41,169 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1999 transitions. Word has length 97 [2023-11-12 02:14:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:41,169 INFO L495 AbstractCegarLoop]: Abstraction has 1594 states and 1999 transitions. [2023-11-12 02:14:41,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.5) internal successors, (243), 18 states have internal predecessors, (243), 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:14:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1999 transitions. [2023-11-12 02:14:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-12 02:14:41,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:41,175 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:41,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:41,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-12 02:14:41,382 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:14:41,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1677598275, now seen corresponding path program 1 times [2023-11-12 02:14:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652321507] [2023-11-12 02:14:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:41,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-12 02:14:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652321507] [2023-11-12 02:14:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652321507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367439018] [2023-11-12 02:14:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:41,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:41,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-12 02:14:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:42,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 02:14:42,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-12 02:14:42,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-12 02:14:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367439018] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:42,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-11-12 02:14:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234282566] [2023-11-12 02:14:42,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:42,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 02:14:42,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 02:14:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:14:42,672 INFO L87 Difference]: Start difference. First operand 1594 states and 1999 transitions. Second operand has 16 states, 16 states have (on average 15.6875) internal successors, (251), 16 states have internal predecessors, (251), 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:14:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:44,749 INFO L93 Difference]: Finished difference Result 6042 states and 7232 transitions. [2023-11-12 02:14:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-12 02:14:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.6875) internal successors, (251), 16 states have internal predecessors, (251), 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 101 [2023-11-12 02:14:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:44,757 INFO L225 Difference]: With dead ends: 6042 [2023-11-12 02:14:44,757 INFO L226 Difference]: Without dead ends: 3391 [2023-11-12 02:14:44,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=488, Invalid=1404, Unknown=0, NotChecked=0, Total=1892 [2023-11-12 02:14:44,762 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 1050 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:44,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 2469 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:14:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2023-11-12 02:14:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 922. [2023-11-12 02:14:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 1.296416938110749) internal successors, (1194), 921 states have internal predecessors, (1194), 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:14:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1194 transitions. [2023-11-12 02:14:44,893 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1194 transitions. Word has length 101 [2023-11-12 02:14:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:44,893 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1194 transitions. [2023-11-12 02:14:44,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.6875) internal successors, (251), 16 states have internal predecessors, (251), 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:14:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1194 transitions. [2023-11-12 02:14:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-12 02:14:44,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:44,896 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:44,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:45,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-12 02:14:45,102 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:14:45,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -693822748, now seen corresponding path program 1 times [2023-11-12 02:14:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:45,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134542224] [2023-11-12 02:14:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134542224] [2023-11-12 02:14:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134542224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845598712] [2023-11-12 02:14:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:45,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:45,520 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:45,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-12 02:14:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:45,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:14:45,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:14:45,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:14:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845598712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:45,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 6] total 14 [2023-11-12 02:14:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725781870] [2023-11-12 02:14:45,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:45,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:14:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:14:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:14:45,956 INFO L87 Difference]: Start difference. First operand 922 states and 1194 transitions. Second operand has 14 states, 14 states have (on average 14.428571428571429) internal successors, (202), 14 states have internal predecessors, (202), 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:14:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:46,560 INFO L93 Difference]: Finished difference Result 1474 states and 1885 transitions. [2023-11-12 02:14:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:14:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.428571428571429) internal successors, (202), 14 states have internal predecessors, (202), 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 101 [2023-11-12 02:14:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:46,563 INFO L225 Difference]: With dead ends: 1474 [2023-11-12 02:14:46,563 INFO L226 Difference]: Without dead ends: 557 [2023-11-12 02:14:46,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:14:46,566 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 348 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:46,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 363 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:14:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-11-12 02:14:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 412. [2023-11-12 02:14:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.1581508515815084) internal successors, (476), 411 states have internal predecessors, (476), 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:14:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 476 transitions. [2023-11-12 02:14:46,642 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 476 transitions. Word has length 101 [2023-11-12 02:14:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:46,642 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 476 transitions. [2023-11-12 02:14:46,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.428571428571429) internal successors, (202), 14 states have internal predecessors, (202), 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:14:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 476 transitions. [2023-11-12 02:14:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-12 02:14:46,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:46,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2023-11-12 02:14:46,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:46,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-12 02:14:46,851 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-12 02:14:46,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1365348958, now seen corresponding path program 1 times [2023-11-12 02:14:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:46,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309990509] [2023-11-12 02:14:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:46,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:47,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:47,035 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:14:47,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-12 02:14:47,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-12 02:14:47,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-12 02:14:47,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-12 02:14:47,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-12 02:14:47,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-12 02:14:47,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-12 02:14:47,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-12 02:14:47,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-12 02:14:47,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-12 02:14:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-12 02:14:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-12 02:14:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-12 02:14:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-12 02:14:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-12 02:14:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-12 02:14:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-12 02:14:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-12 02:14:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-12 02:14:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-12 02:14:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-12 02:14:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-12 02:14:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-12 02:14:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-12 02:14:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-12 02:14:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-12 02:14:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-12 02:14:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-12 02:14:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-12 02:14:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-12 02:14:47,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-12 02:14:47,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-12 02:14:47,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-12 02:14:47,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-12 02:14:47,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-12 02:14:47,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-12 02:14:47,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-12 02:14:47,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-12 02:14:47,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-12 02:14:47,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-12 02:14:47,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-12 02:14:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-12 02:14:47,055 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, 1] [2023-11-12 02:14:47,059 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:14:47,151 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:14:47,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:14:47,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:14:47 BoogieIcfgContainer [2023-11-12 02:14:47,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:14:47,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:14:47,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:14:47,187 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:14:47,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:14" (3/4) ... [2023-11-12 02:14:47,189 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:14:47,225 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,226 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,226 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,226 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:14:47,226 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-12 02:14:47,226 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-12 02:14:47,298 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:14:47,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:14:47,300 INFO L158 Benchmark]: Toolchain (without parser) took 34427.51ms. Allocated memory was 151.0MB in the beginning and 356.5MB in the end (delta: 205.5MB). Free memory was 103.9MB in the beginning and 217.3MB in the end (delta: -113.4MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,300 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 120.9MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:14:47,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.09ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 90.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.48ms. Allocated memory is still 151.0MB. Free memory was 89.8MB in the beginning and 85.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,301 INFO L158 Benchmark]: Boogie Preprocessor took 56.37ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,308 INFO L158 Benchmark]: RCFGBuilder took 1136.91ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 83.8MB in the beginning and 165.1MB in the end (delta: -81.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,309 INFO L158 Benchmark]: TraceAbstraction took 32584.76ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 164.1MB in the beginning and 225.7MB in the end (delta: -61.6MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,309 INFO L158 Benchmark]: Witness Printer took 111.80ms. Allocated memory is still 356.5MB. Free memory was 224.6MB in the beginning and 217.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:14:47,315 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.42ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 120.9MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.09ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 90.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.48ms. Allocated memory is still 151.0MB. Free memory was 89.8MB in the beginning and 85.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.37ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1136.91ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 83.8MB in the beginning and 165.1MB in the end (delta: -81.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32584.76ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 164.1MB in the beginning and 225.7MB in the end (delta: -61.6MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. * Witness Printer took 111.80ms. Allocated memory is still 356.5MB. Free memory was 224.6MB in the beginning and 217.3MB 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] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=2, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=1, i=3, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=3, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, 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)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r1 << 8U VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r2 << 16U VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1912712859, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=1912712859, b1=7471534, b2=29185, b3=114, b=1912712859, carry=0, i=4, na=4, 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.3s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8541 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8541 mSDsluCounter, 16315 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12457 mSDsCounter, 432 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7552 IncrementalHoareTripleChecker+Invalid, 7984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 432 mSolverCounterUnsat, 3858 mSDtfsCounter, 7552 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 1462 SyntacticMatches, 7 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1692occurred in iteration=19, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 18804 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2815 NumberOfCodeBlocks, 2815 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 13544 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1930 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 44 InterpolantComputations, 21 PerfectInterpolantSequences, 2226/2817 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:14:47,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96404f0c-4541-4f10-a199-50e565a41475/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)