./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:29:32,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:29:32,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:29:32,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:29:32,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:29:32,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:29:32,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:29:32,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:29:32,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:29:32,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:29:32,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:29:32,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:29:32,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:29:32,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:29:32,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:29:32,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:29:32,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:29:32,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:29:32,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:29:32,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:29:32,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:29:32,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:29:32,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:29:32,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:29:32,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:29:32,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:29:32,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:29:32,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:29:32,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:29:32,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:29:32,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:29:32,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:29:32,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:29:32,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:29:32,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:29:32,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:29:32,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:29:32,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:29:32,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:29:32,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:29:32,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:29:32,895 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 17:29:32,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:29:32,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:29:32,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:29:32,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:29:32,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:29:32,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:29:32,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:29:32,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:29:32,943 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:29:32,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:29:32,944 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:29:32,945 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:29:32,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:29:32,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:29:32,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:29:32,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:29:32,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:29:32,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:29:32,946 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:29:32,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:29:32,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:29:32,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:29:32,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:29:32,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:29:32,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:29:32,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:29:32,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:29:32,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:29:32,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:29:32,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:29:32,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:29:32,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:29:32,951 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:29:32,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:29:32,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:29:32,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/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_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2022-11-21 17:29:33,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:29:33,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:29:33,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:29:33,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:29:33,314 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:29:33,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/bitvector/byte_add-2.i [2022-11-21 17:29:36,390 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:29:36,609 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:29:36,610 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/sv-benchmarks/c/bitvector/byte_add-2.i [2022-11-21 17:29:36,620 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/data/feaa76382/eae939455d484d41af2b260cc16f2565/FLAG9ce50c248 [2022-11-21 17:29:36,641 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/data/feaa76382/eae939455d484d41af2b260cc16f2565 [2022-11-21 17:29:36,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:29:36,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:29:36,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:29:36,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:29:36,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:29:36,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:29:36" (1/1) ... [2022-11-21 17:29:36,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64068445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:36, skipping insertion in model container [2022-11-21 17:29:36,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:29:36" (1/1) ... [2022-11-21 17:29:36,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:29:36,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:29:36,902 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-11-21 17:29:36,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:29:36,948 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:29:36,960 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-11-21 17:29:36,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:29:37,007 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:29:37,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37 WrapperNode [2022-11-21 17:29:37,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:29:37,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:29:37,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:29:37,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:29:37,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,077 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 180 [2022-11-21 17:29:37,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:29:37,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:29:37,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:29:37,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:29:37,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,106 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:29:37,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:29:37,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:29:37,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:29:37,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (1/1) ... [2022-11-21 17:29:37,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:29:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:37,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:29:37,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:29:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:29:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:29:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:29:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:29:37,300 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:29:37,304 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:29:37,828 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:29:37,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:29:37,836 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 17:29:37,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:29:37 BoogieIcfgContainer [2022-11-21 17:29:37,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:29:37,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:29:37,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:29:37,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:29:37,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:29:36" (1/3) ... [2022-11-21 17:29:37,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40151263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:29:37, skipping insertion in model container [2022-11-21 17:29:37,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:29:37" (2/3) ... [2022-11-21 17:29:37,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40151263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:29:37, skipping insertion in model container [2022-11-21 17:29:37,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:29:37" (3/3) ... [2022-11-21 17:29:37,857 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2022-11-21 17:29:37,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:29:37,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-21 17:29:37,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:29:37,999 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b43d76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:29:38,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-21 17:29:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 81 states have (on average 1.8888888888888888) internal successors, (153), 119 states have internal predecessors, (153), 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) [2022-11-21 17:29:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 17:29:38,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:38,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 17:29:38,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-21 17:29:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412177917] [2022-11-21 17:29:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:38,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412177917] [2022-11-21 17:29:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412177917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 17:29:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694213124] [2022-11-21 17:29:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:38,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 17:29:38,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 17:29:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:29:38,328 INFO L87 Difference]: Start difference. First operand has 120 states, 81 states have (on average 1.8888888888888888) internal successors, (153), 119 states have internal predecessors, (153), 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) [2022-11-21 17:29:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:38,361 INFO L93 Difference]: Finished difference Result 144 states and 192 transitions. [2022-11-21 17:29:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 17:29:38,363 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 [2022-11-21 17:29:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:38,371 INFO L225 Difference]: With dead ends: 144 [2022-11-21 17:29:38,371 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 17:29:38,375 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 [2022-11-21 17:29:38,378 INFO L413 NwaCegarLoop]: 113 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, 113 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 [2022-11-21 17:29:38,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:29:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 17:29:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-21 17:29:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 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) [2022-11-21 17:29:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2022-11-21 17:29:38,416 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 4 [2022-11-21 17:29:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:38,416 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2022-11-21 17:29:38,416 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) [2022-11-21 17:29:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2022-11-21 17:29:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 17:29:38,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:38,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:38,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:29:38,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1995494874, now seen corresponding path program 1 times [2022-11-21 17:29:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:38,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729933620] [2022-11-21 17:29:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:38,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:38,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729933620] [2022-11-21 17:29:38,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729933620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:38,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:38,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993024313] [2022-11-21 17:29:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:38,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:29:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:29:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:29:38,620 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-21 17:29:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:38,843 INFO L93 Difference]: Finished difference Result 154 states and 227 transitions. [2022-11-21 17:29:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:29:38,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-11-21 17:29:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:38,846 INFO L225 Difference]: With dead ends: 154 [2022-11-21 17:29:38,846 INFO L226 Difference]: Without dead ends: 104 [2022-11-21 17:29:38,846 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 [2022-11-21 17:29:38,847 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 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 [2022-11-21 17:29:38,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-21 17:29:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-11-21 17:29:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 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) [2022-11-21 17:29:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2022-11-21 17:29:38,864 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 13 [2022-11-21 17:29:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:38,865 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2022-11-21 17:29:38,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-21 17:29:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2022-11-21 17:29:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 17:29:38,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:38,870 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] [2022-11-21 17:29:38,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:29:38,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2081168916, now seen corresponding path program 1 times [2022-11-21 17:29:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:38,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83126965] [2022-11-21 17:29:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:29:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:39,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83126965] [2022-11-21 17:29:39,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83126965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:29:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692480643] [2022-11-21 17:29:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:39,172 INFO L87 Difference]: Start difference. First operand 100 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-11-21 17:29:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:39,461 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2022-11-21 17:29:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-21 17:29:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:39,463 INFO L225 Difference]: With dead ends: 239 [2022-11-21 17:29:39,463 INFO L226 Difference]: Without dead ends: 176 [2022-11-21 17:29:39,464 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 [2022-11-21 17:29:39,466 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 132 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 306 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 [2022-11-21 17:29:39,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 306 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-21 17:29:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 110. [2022-11-21 17:29:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 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) [2022-11-21 17:29:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2022-11-21 17:29:39,485 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 145 transitions. Word has length 20 [2022-11-21 17:29:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:39,486 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 145 transitions. [2022-11-21 17:29:39,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-11-21 17:29:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 145 transitions. [2022-11-21 17:29:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 17:29:39,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:39,492 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] [2022-11-21 17:29:39,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:29:39,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:39,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash 460336243, now seen corresponding path program 1 times [2022-11-21 17:29:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:39,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859908539] [2022-11-21 17:29:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:29:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:39,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859908539] [2022-11-21 17:29:39,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859908539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:39,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:39,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:29:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933739204] [2022-11-21 17:29:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:39,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:39,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:39,742 INFO L87 Difference]: Start difference. First operand 110 states and 145 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-11-21 17:29:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:39,981 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2022-11-21 17:29:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2022-11-21 17:29:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:39,984 INFO L225 Difference]: With dead ends: 277 [2022-11-21 17:29:39,984 INFO L226 Difference]: Without dead ends: 206 [2022-11-21 17:29:39,985 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 [2022-11-21 17:29:39,986 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 316 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 [2022-11-21 17:29:39,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 316 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-21 17:29:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2022-11-21 17:29:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 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) [2022-11-21 17:29:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2022-11-21 17:29:39,999 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 23 [2022-11-21 17:29:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:40,000 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2022-11-21 17:29:40,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-11-21 17:29:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2022-11-21 17:29:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 17:29:40,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:40,002 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] [2022-11-21 17:29:40,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:29:40,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash -597656241, now seen corresponding path program 1 times [2022-11-21 17:29:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749970771] [2022-11-21 17:29:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:40,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749970771] [2022-11-21 17:29:40,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749970771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:40,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805404519] [2022-11-21 17:29:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:40,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:40,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:29:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:40,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:29:40,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:40,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:40,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805404519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:40,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:40,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-21 17:29:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811270634] [2022-11-21 17:29:40,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:40,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:40,376 INFO L87 Difference]: Start difference. First operand 126 states and 164 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) [2022-11-21 17:29:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:40,594 INFO L93 Difference]: Finished difference Result 231 states and 332 transitions. [2022-11-21 17:29:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:40,595 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 [2022-11-21 17:29:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:40,597 INFO L225 Difference]: With dead ends: 231 [2022-11-21 17:29:40,597 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 17:29:40,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:40,601 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:40,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 184 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 17:29:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2022-11-21 17:29:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.2941176470588236) internal successors, (198), 153 states have internal predecessors, (198), 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) [2022-11-21 17:29:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2022-11-21 17:29:40,613 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 26 [2022-11-21 17:29:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:40,614 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2022-11-21 17:29:40,614 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) [2022-11-21 17:29:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2022-11-21 17:29:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 17:29:40,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:40,627 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] [2022-11-21 17:29:40,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:40,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:40,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2049867769, now seen corresponding path program 1 times [2022-11-21 17:29:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:40,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530669327] [2022-11-21 17:29:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:41,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530669327] [2022-11-21 17:29:41,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530669327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:41,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551180550] [2022-11-21 17:29:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:41,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:41,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:41,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:29:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:29:41,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:29:41,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551180550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 17:29:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383198701] [2022-11-21 17:29:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:41,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:41,224 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-21 17:29:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:41,492 INFO L93 Difference]: Finished difference Result 317 states and 436 transitions. [2022-11-21 17:29:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 [2022-11-21 17:29:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:41,494 INFO L225 Difference]: With dead ends: 317 [2022-11-21 17:29:41,494 INFO L226 Difference]: Without dead ends: 216 [2022-11-21 17:29:41,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:41,496 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 240 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 [2022-11-21 17:29:41,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 240 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-21 17:29:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2022-11-21 17:29:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.281767955801105) internal successors, (232), 181 states have internal predecessors, (232), 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) [2022-11-21 17:29:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2022-11-21 17:29:41,528 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 33 [2022-11-21 17:29:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:41,529 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2022-11-21 17:29:41,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-21 17:29:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2022-11-21 17:29:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 17:29:41,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:41,530 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] [2022-11-21 17:29:41,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 17:29:41,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 950600083, now seen corresponding path program 1 times [2022-11-21 17:29:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072289064] [2022-11-21 17:29:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:41,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072289064] [2022-11-21 17:29:41,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072289064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463226081] [2022-11-21 17:29:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:41,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:41,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:29:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:41,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:29:41,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:29:44,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:44,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463226081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:44,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:44,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-21 17:29:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721350428] [2022-11-21 17:29:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:44,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:44,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:44,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2022-11-21 17:29:44,100 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-21 17:29:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:44,614 INFO L93 Difference]: Finished difference Result 373 states and 502 transitions. [2022-11-21 17:29:44,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 40 [2022-11-21 17:29:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:44,616 INFO L225 Difference]: With dead ends: 373 [2022-11-21 17:29:44,616 INFO L226 Difference]: Without dead ends: 244 [2022-11-21 17:29:44,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2022-11-21 17:29:44,618 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 240 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.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:44,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 240 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:29:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-21 17:29:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2022-11-21 17:29:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 209 states have internal predecessors, (266), 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) [2022-11-21 17:29:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 266 transitions. [2022-11-21 17:29:44,640 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 266 transitions. Word has length 40 [2022-11-21 17:29:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:44,641 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 266 transitions. [2022-11-21 17:29:44,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-21 17:29:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 266 transitions. [2022-11-21 17:29:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 17:29:44,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:44,642 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] [2022-11-21 17:29:44,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 17:29:44,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 17:29:44,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -54726973, now seen corresponding path program 1 times [2022-11-21 17:29:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927379340] [2022-11-21 17:29:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 17:29:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:44,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927379340] [2022-11-21 17:29:44,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927379340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:44,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:44,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:29:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794302095] [2022-11-21 17:29:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:44,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:29:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:44,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:29:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:29:44,920 INFO L87 Difference]: Start difference. First operand 210 states and 266 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2022-11-21 17:29:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:44,933 INFO L93 Difference]: Finished difference Result 247 states and 307 transitions. [2022-11-21 17:29:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:29:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 47 [2022-11-21 17:29:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:44,935 INFO L225 Difference]: With dead ends: 247 [2022-11-21 17:29:44,935 INFO L226 Difference]: Without dead ends: 184 [2022-11-21 17:29:44,935 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 [2022-11-21 17:29:44,936 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 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 [2022-11-21 17:29:44,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:29:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-21 17:29:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-11-21 17:29:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 183 states have internal predecessors, (232), 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) [2022-11-21 17:29:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2022-11-21 17:29:44,944 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 47 [2022-11-21 17:29:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:44,944 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2022-11-21 17:29:44,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2022-11-21 17:29:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-11-21 17:29:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 17:29:44,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:44,946 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] [2022-11-21 17:29:44,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:29:44,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1213827177, now seen corresponding path program 1 times [2022-11-21 17:29:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:44,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478563433] [2022-11-21 17:29:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-21 17:29:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:45,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478563433] [2022-11-21 17:29:45,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478563433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:45,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:45,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:29:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548777524] [2022-11-21 17:29:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:45,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:29:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:29:45,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:29:45,244 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2022-11-21 17:29:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:45,489 INFO L93 Difference]: Finished difference Result 522 states and 668 transitions. [2022-11-21 17:29:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:29:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 59 [2022-11-21 17:29:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:45,491 INFO L225 Difference]: With dead ends: 522 [2022-11-21 17:29:45,491 INFO L226 Difference]: Without dead ends: 389 [2022-11-21 17:29:45,492 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 [2022-11-21 17:29:45,492 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 181 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:45,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 190 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:29:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-21 17:29:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 224. [2022-11-21 17:29:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.2600896860986548) internal successors, (281), 223 states have internal predecessors, (281), 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) [2022-11-21 17:29:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2022-11-21 17:29:45,503 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 59 [2022-11-21 17:29:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:45,503 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2022-11-21 17:29:45,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2022-11-21 17:29:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2022-11-21 17:29:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 17:29:45,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:45,505 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:29:45,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:29:45,505 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash -247307669, now seen corresponding path program 1 times [2022-11-21 17:29:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:45,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667789414] [2022-11-21 17:29:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 17:29:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:45,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667789414] [2022-11-21 17:29:45,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667789414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:45,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:45,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:29:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865662069] [2022-11-21 17:29:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:45,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:45,612 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:29:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:45,700 INFO L93 Difference]: Finished difference Result 495 states and 619 transitions. [2022-11-21 17:29:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-21 17:29:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:45,702 INFO L225 Difference]: With dead ends: 495 [2022-11-21 17:29:45,703 INFO L226 Difference]: Without dead ends: 322 [2022-11-21 17:29:45,703 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 [2022-11-21 17:29:45,704 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 55 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:45,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 339 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:29:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-21 17:29:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2022-11-21 17:29:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.288702928870293) internal successors, (308), 239 states have internal predecessors, (308), 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) [2022-11-21 17:29:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2022-11-21 17:29:45,719 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 68 [2022-11-21 17:29:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:45,719 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2022-11-21 17:29:45,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:29:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2022-11-21 17:29:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 17:29:45,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:45,721 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:45,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:29:45,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 219507060, now seen corresponding path program 1 times [2022-11-21 17:29:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530978024] [2022-11-21 17:29:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 17:29:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:45,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530978024] [2022-11-21 17:29:45,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530978024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:45,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:45,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:29:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481553514] [2022-11-21 17:29:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:45,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:29:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:29:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:45,951 INFO L87 Difference]: Start difference. First operand 240 states and 308 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2022-11-21 17:29:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:46,323 INFO L93 Difference]: Finished difference Result 679 states and 880 transitions. [2022-11-21 17:29:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:29:46,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 72 [2022-11-21 17:29:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:46,326 INFO L225 Difference]: With dead ends: 679 [2022-11-21 17:29:46,326 INFO L226 Difference]: Without dead ends: 485 [2022-11-21 17:29:46,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:29:46,327 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 233 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:46,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 283 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:29:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-21 17:29:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 394. [2022-11-21 17:29:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.2926208651399491) internal successors, (508), 393 states have internal predecessors, (508), 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) [2022-11-21 17:29:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2022-11-21 17:29:46,349 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 72 [2022-11-21 17:29:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:46,350 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2022-11-21 17:29:46,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2022-11-21 17:29:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2022-11-21 17:29:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 17:29:46,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:46,352 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-21 17:29:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:29:46,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1182880680, now seen corresponding path program 1 times [2022-11-21 17:29:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:46,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474638357] [2022-11-21 17:29:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 17:29:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474638357] [2022-11-21 17:29:46,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474638357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452150166] [2022-11-21 17:29:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:46,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:46,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:29:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:46,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:29:46,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:29:46,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:46,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452150166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:46,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:46,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-21 17:29:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952894562] [2022-11-21 17:29:46,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:46,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:46,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:46,633 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:29:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:46,792 INFO L93 Difference]: Finished difference Result 1056 states and 1358 transitions. [2022-11-21 17:29:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:46,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-21 17:29:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:46,796 INFO L225 Difference]: With dead ends: 1056 [2022-11-21 17:29:46,796 INFO L226 Difference]: Without dead ends: 676 [2022-11-21 17:29:46,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:46,797 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 91 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:46,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 236 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:29:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-21 17:29:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 547. [2022-11-21 17:29:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.2967032967032968) internal successors, (708), 546 states have internal predecessors, (708), 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) [2022-11-21 17:29:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 708 transitions. [2022-11-21 17:29:46,824 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 708 transitions. Word has length 72 [2022-11-21 17:29:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:46,824 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 708 transitions. [2022-11-21 17:29:46,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:29:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 708 transitions. [2022-11-21 17:29:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 17:29:46,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:46,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:46,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:47,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 17:29:47,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -638817567, now seen corresponding path program 1 times [2022-11-21 17:29:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:47,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933141054] [2022-11-21 17:29:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 17:29:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:47,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933141054] [2022-11-21 17:29:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933141054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:47,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:47,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:29:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241392439] [2022-11-21 17:29:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:47,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:29:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:29:47,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:47,227 INFO L87 Difference]: Start difference. First operand 547 states and 708 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2022-11-21 17:29:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:47,580 INFO L93 Difference]: Finished difference Result 1320 states and 1700 transitions. [2022-11-21 17:29:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:29:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 72 [2022-11-21 17:29:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:47,583 INFO L225 Difference]: With dead ends: 1320 [2022-11-21 17:29:47,583 INFO L226 Difference]: Without dead ends: 789 [2022-11-21 17:29:47,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:29:47,584 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 286 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:47,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 251 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:29:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-21 17:29:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 669. [2022-11-21 17:29:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.2964071856287425) internal successors, (866), 668 states have internal predecessors, (866), 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) [2022-11-21 17:29:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 866 transitions. [2022-11-21 17:29:47,613 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 866 transitions. Word has length 72 [2022-11-21 17:29:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:47,614 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 866 transitions. [2022-11-21 17:29:47,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2022-11-21 17:29:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 866 transitions. [2022-11-21 17:29:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-21 17:29:47,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:47,616 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] [2022-11-21 17:29:47,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:29:47,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1445795659, now seen corresponding path program 1 times [2022-11-21 17:29:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187350437] [2022-11-21 17:29:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-21 17:29:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187350437] [2022-11-21 17:29:47,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187350437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:47,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:47,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374349248] [2022-11-21 17:29:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:47,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:29:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:29:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:29:47,710 INFO L87 Difference]: Start difference. First operand 669 states and 866 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-11-21 17:29:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:47,765 INFO L93 Difference]: Finished difference Result 1285 states and 1668 transitions. [2022-11-21 17:29:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:29:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 76 [2022-11-21 17:29:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:47,768 INFO L225 Difference]: With dead ends: 1285 [2022-11-21 17:29:47,768 INFO L226 Difference]: Without dead ends: 669 [2022-11-21 17:29:47,769 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 [2022-11-21 17:29:47,770 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:47,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:29:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-21 17:29:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-11-21 17:29:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.2634730538922156) internal successors, (844), 668 states have internal predecessors, (844), 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) [2022-11-21 17:29:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 844 transitions. [2022-11-21 17:29:47,798 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 844 transitions. Word has length 76 [2022-11-21 17:29:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:47,798 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 844 transitions. [2022-11-21 17:29:47,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-11-21 17:29:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 844 transitions. [2022-11-21 17:29:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 17:29:47,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:47,800 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] [2022-11-21 17:29:47,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:29:47,801 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2074406357, now seen corresponding path program 1 times [2022-11-21 17:29:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:47,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282115764] [2022-11-21 17:29:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:29:47,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:47,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282115764] [2022-11-21 17:29:47,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282115764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956530794] [2022-11-21 17:29:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:47,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:47,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:29:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:48,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 17:29:48,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:29:48,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:29:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:29:48,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956530794] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:29:48,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:29:48,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2022-11-21 17:29:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137681127] [2022-11-21 17:29:48,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:29:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:29:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:29:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:29:48,293 INFO L87 Difference]: Start difference. First operand 669 states and 844 transitions. Second operand has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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) [2022-11-21 17:29:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:50,344 INFO L93 Difference]: Finished difference Result 4008 states and 4906 transitions. [2022-11-21 17:29:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 17:29:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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 [2022-11-21 17:29:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:50,354 INFO L225 Difference]: With dead ends: 4008 [2022-11-21 17:29:50,354 INFO L226 Difference]: Without dead ends: 3320 [2022-11-21 17:29:50,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-11-21 17:29:50,358 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 707 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:50,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 950 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 17:29:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-11-21 17:29:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 958. [2022-11-21 17:29:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.3636363636363635) internal successors, (1305), 957 states have internal predecessors, (1305), 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) [2022-11-21 17:29:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1305 transitions. [2022-11-21 17:29:50,422 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1305 transitions. Word has length 77 [2022-11-21 17:29:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:50,422 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1305 transitions. [2022-11-21 17:29:50,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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) [2022-11-21 17:29:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1305 transitions. [2022-11-21 17:29:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 17:29:50,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:50,424 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] [2022-11-21 17:29:50,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:50,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 17:29:50,630 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1304730611, now seen corresponding path program 1 times [2022-11-21 17:29:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:50,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291062770] [2022-11-21 17:29:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 17:29:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:50,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291062770] [2022-11-21 17:29:50,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291062770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:50,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:50,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:29:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921641345] [2022-11-21 17:29:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:50,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:29:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:29:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:50,835 INFO L87 Difference]: Start difference. First operand 958 states and 1305 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2022-11-21 17:29:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:51,336 INFO L93 Difference]: Finished difference Result 2301 states and 3113 transitions. [2022-11-21 17:29:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:29:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 [2022-11-21 17:29:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:51,341 INFO L225 Difference]: With dead ends: 2301 [2022-11-21 17:29:51,341 INFO L226 Difference]: Without dead ends: 1275 [2022-11-21 17:29:51,344 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 [2022-11-21 17:29:51,345 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 327 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:51,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 283 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:29:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-11-21 17:29:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1149. [2022-11-21 17:29:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.3641114982578397) internal successors, (1566), 1148 states have internal predecessors, (1566), 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) [2022-11-21 17:29:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1566 transitions. [2022-11-21 17:29:51,412 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1566 transitions. Word has length 77 [2022-11-21 17:29:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:51,412 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1566 transitions. [2022-11-21 17:29:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2022-11-21 17:29:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1566 transitions. [2022-11-21 17:29:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 17:29:51,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:51,414 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] [2022-11-21 17:29:51,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 17:29:51,414 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash -505233014, now seen corresponding path program 1 times [2022-11-21 17:29:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:51,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607421775] [2022-11-21 17:29:51,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:29:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:51,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607421775] [2022-11-21 17:29:51,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607421775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:51,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:51,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:29:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372361359] [2022-11-21 17:29:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:51,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:29:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:29:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:51,612 INFO L87 Difference]: Start difference. First operand 1149 states and 1566 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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) [2022-11-21 17:29:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:52,148 INFO L93 Difference]: Finished difference Result 2617 states and 3550 transitions. [2022-11-21 17:29:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:29:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 [2022-11-21 17:29:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:52,154 INFO L225 Difference]: With dead ends: 2617 [2022-11-21 17:29:52,154 INFO L226 Difference]: Without dead ends: 1447 [2022-11-21 17:29:52,155 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 [2022-11-21 17:29:52,156 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 288 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:52,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 377 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:29:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-11-21 17:29:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1321. [2022-11-21 17:29:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3666666666666667) internal successors, (1804), 1320 states have internal predecessors, (1804), 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) [2022-11-21 17:29:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1804 transitions. [2022-11-21 17:29:52,239 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1804 transitions. Word has length 77 [2022-11-21 17:29:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:52,240 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1804 transitions. [2022-11-21 17:29:52,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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) [2022-11-21 17:29:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1804 transitions. [2022-11-21 17:29:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-21 17:29:52,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:52,242 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] [2022-11-21 17:29:52,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 17:29:52,242 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 814218614, now seen corresponding path program 1 times [2022-11-21 17:29:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:52,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847146807] [2022-11-21 17:29:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-21 17:29:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:52,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847146807] [2022-11-21 17:29:52,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847146807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:52,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:52,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:29:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609336892] [2022-11-21 17:29:52,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:29:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:29:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:29:52,444 INFO L87 Difference]: Start difference. First operand 1321 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2022-11-21 17:29:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:52,880 INFO L93 Difference]: Finished difference Result 4144 states and 5644 transitions. [2022-11-21 17:29:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:29:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 [2022-11-21 17:29:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:52,893 INFO L225 Difference]: With dead ends: 4144 [2022-11-21 17:29:52,893 INFO L226 Difference]: Without dead ends: 3953 [2022-11-21 17:29:52,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:52,896 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 271 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:52,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 466 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:29:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-11-21 17:29:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 1321. [2022-11-21 17:29:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3666666666666667) internal successors, (1804), 1320 states have internal predecessors, (1804), 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) [2022-11-21 17:29:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1804 transitions. [2022-11-21 17:29:53,003 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1804 transitions. Word has length 80 [2022-11-21 17:29:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:53,004 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1804 transitions. [2022-11-21 17:29:53,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2022-11-21 17:29:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1804 transitions. [2022-11-21 17:29:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-21 17:29:53,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:53,006 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] [2022-11-21 17:29:53,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 17:29:53,006 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 618517707, now seen corresponding path program 1 times [2022-11-21 17:29:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:53,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953517353] [2022-11-21 17:29:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 17:29:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953517353] [2022-11-21 17:29:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953517353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:53,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:53,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:29:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900360372] [2022-11-21 17:29:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:53,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:29:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:29:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:29:53,195 INFO L87 Difference]: Start difference. First operand 1321 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-11-21 17:29:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:53,672 INFO L93 Difference]: Finished difference Result 4136 states and 5632 transitions. [2022-11-21 17:29:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:29:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 [2022-11-21 17:29:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:53,699 INFO L225 Difference]: With dead ends: 4136 [2022-11-21 17:29:53,699 INFO L226 Difference]: Without dead ends: 3936 [2022-11-21 17:29:53,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:53,701 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 233 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 416 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 [2022-11-21 17:29:53,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 416 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:29:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2022-11-21 17:29:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 1321. [2022-11-21 17:29:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3666666666666667) internal successors, (1804), 1320 states have internal predecessors, (1804), 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) [2022-11-21 17:29:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1804 transitions. [2022-11-21 17:29:53,797 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1804 transitions. Word has length 80 [2022-11-21 17:29:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:53,797 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1804 transitions. [2022-11-21 17:29:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-11-21 17:29:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1804 transitions. [2022-11-21 17:29:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 17:29:53,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:53,800 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] [2022-11-21 17:29:53,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 17:29:53,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2082738387, now seen corresponding path program 1 times [2022-11-21 17:29:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:53,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989967859] [2022-11-21 17:29:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-21 17:29:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989967859] [2022-11-21 17:29:54,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989967859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:54,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:54,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:29:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089764868] [2022-11-21 17:29:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:29:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:29:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:54,008 INFO L87 Difference]: Start difference. First operand 1321 states and 1804 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-11-21 17:29:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:54,765 INFO L93 Difference]: Finished difference Result 5468 states and 7448 transitions. [2022-11-21 17:29:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:29:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 [2022-11-21 17:29:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:54,783 INFO L225 Difference]: With dead ends: 5468 [2022-11-21 17:29:54,783 INFO L226 Difference]: Without dead ends: 5277 [2022-11-21 17:29:54,785 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 [2022-11-21 17:29:54,786 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 407 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:54,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 784 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:29:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2022-11-21 17:29:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 1321. [2022-11-21 17:29:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3666666666666667) internal successors, (1804), 1320 states have internal predecessors, (1804), 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) [2022-11-21 17:29:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1804 transitions. [2022-11-21 17:29:54,905 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1804 transitions. Word has length 83 [2022-11-21 17:29:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:54,906 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1804 transitions. [2022-11-21 17:29:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-11-21 17:29:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1804 transitions. [2022-11-21 17:29:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 17:29:54,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:54,908 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] [2022-11-21 17:29:54,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 17:29:54,909 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -112361859, now seen corresponding path program 1 times [2022-11-21 17:29:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:54,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895837809] [2022-11-21 17:29:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 17:29:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895837809] [2022-11-21 17:29:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895837809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:55,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:29:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472253797] [2022-11-21 17:29:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:55,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:29:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:29:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:55,196 INFO L87 Difference]: Start difference. First operand 1321 states and 1804 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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) [2022-11-21 17:29:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:56,006 INFO L93 Difference]: Finished difference Result 5450 states and 7423 transitions. [2022-11-21 17:29:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:29:56,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 83 [2022-11-21 17:29:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:56,041 INFO L225 Difference]: With dead ends: 5450 [2022-11-21 17:29:56,041 INFO L226 Difference]: Without dead ends: 5250 [2022-11-21 17:29:56,059 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 [2022-11-21 17:29:56,059 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 349 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:56,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 682 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:29:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2022-11-21 17:29:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 1321. [2022-11-21 17:29:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3666666666666667) internal successors, (1804), 1320 states have internal predecessors, (1804), 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) [2022-11-21 17:29:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1804 transitions. [2022-11-21 17:29:56,187 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1804 transitions. Word has length 83 [2022-11-21 17:29:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:56,187 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1804 transitions. [2022-11-21 17:29:56,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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) [2022-11-21 17:29:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1804 transitions. [2022-11-21 17:29:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 17:29:56,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:56,190 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] [2022-11-21 17:29:56,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 17:29:56,190 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash -915467124, now seen corresponding path program 1 times [2022-11-21 17:29:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:56,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392343743] [2022-11-21 17:29:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:29:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:56,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392343743] [2022-11-21 17:29:56,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392343743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:56,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958586310] [2022-11-21 17:29:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:56,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:56,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:29:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:29:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 17:29:56,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:29:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 17:29:56,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958586310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:29:56,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:29:56,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2022-11-21 17:29:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93251602] [2022-11-21 17:29:56,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:29:56,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:29:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:56,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:29:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:29:56,875 INFO L87 Difference]: Start difference. First operand 1321 states and 1804 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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) [2022-11-21 17:29:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:58,200 INFO L93 Difference]: Finished difference Result 5212 states and 7426 transitions. [2022-11-21 17:29:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 17:29:58,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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 [2022-11-21 17:29:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:58,208 INFO L225 Difference]: With dead ends: 5212 [2022-11-21 17:29:58,209 INFO L226 Difference]: Without dead ends: 3908 [2022-11-21 17:29:58,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 160 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2022-11-21 17:29:58,213 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 693 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:58,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 502 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 17:29:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2022-11-21 17:29:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2953. [2022-11-21 17:29:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.3035230352303524) internal successors, (3848), 2952 states have internal predecessors, (3848), 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) [2022-11-21 17:29:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3848 transitions. [2022-11-21 17:29:58,449 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3848 transitions. Word has length 83 [2022-11-21 17:29:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:29:58,450 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3848 transitions. [2022-11-21 17:29:58,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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) [2022-11-21 17:29:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3848 transitions. [2022-11-21 17:29:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 17:29:58,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:29:58,453 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] [2022-11-21 17:29:58,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:58,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:58,668 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:29:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash 928368216, now seen corresponding path program 1 times [2022-11-21 17:29:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:58,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166291099] [2022-11-21 17:29:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:29:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166291099] [2022-11-21 17:29:58,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166291099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666459586] [2022-11-21 17:29:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:58,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:58,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:58,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:58,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:29:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:58,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:29:58,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:29:59,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666459586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:59,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-21 17:29:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214154310] [2022-11-21 17:29:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:59,145 INFO L87 Difference]: Start difference. First operand 2953 states and 3848 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-11-21 17:29:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:29:59,612 INFO L93 Difference]: Finished difference Result 6256 states and 8133 transitions. [2022-11-21 17:29:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 [2022-11-21 17:29:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:29:59,622 INFO L225 Difference]: With dead ends: 6256 [2022-11-21 17:29:59,622 INFO L226 Difference]: Without dead ends: 5768 [2022-11-21 17:29:59,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:29:59,625 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:29:59,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 210 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:29:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2022-11-21 17:30:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 4763. [2022-11-21 17:30:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4762 states have (on average 1.3057538849223016) internal successors, (6218), 4762 states have internal predecessors, (6218), 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) [2022-11-21 17:30:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 6218 transitions. [2022-11-21 17:30:00,023 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 6218 transitions. Word has length 83 [2022-11-21 17:30:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:00,023 INFO L495 AbstractCegarLoop]: Abstraction has 4763 states and 6218 transitions. [2022-11-21 17:30:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-11-21 17:30:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 6218 transitions. [2022-11-21 17:30:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-21 17:30:00,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:00,026 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] [2022-11-21 17:30:00,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:30:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:30:00,233 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:30:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2030636919, now seen corresponding path program 1 times [2022-11-21 17:30:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026598846] [2022-11-21 17:30:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-21 17:30:00,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:30:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026598846] [2022-11-21 17:30:00,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026598846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:30:00,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:30:00,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:30:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628793795] [2022-11-21 17:30:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:30:00,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:30:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:30:00,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:30:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:30:00,477 INFO L87 Difference]: Start difference. First operand 4763 states and 6218 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2022-11-21 17:30:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:30:01,773 INFO L93 Difference]: Finished difference Result 10832 states and 14169 transitions. [2022-11-21 17:30:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:30:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 85 [2022-11-21 17:30:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:30:01,792 INFO L225 Difference]: With dead ends: 10832 [2022-11-21 17:30:01,792 INFO L226 Difference]: Without dead ends: 10580 [2022-11-21 17:30:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:30:01,796 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 513 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:30:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1096 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:30:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10580 states. [2022-11-21 17:30:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10580 to 4742. [2022-11-21 17:30:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4742 states, 4741 states have (on average 1.3058426492301203) internal successors, (6191), 4741 states have internal predecessors, (6191), 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) [2022-11-21 17:30:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 6191 transitions. [2022-11-21 17:30:02,233 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 6191 transitions. Word has length 85 [2022-11-21 17:30:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:02,233 INFO L495 AbstractCegarLoop]: Abstraction has 4742 states and 6191 transitions. [2022-11-21 17:30:02,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2022-11-21 17:30:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 6191 transitions. [2022-11-21 17:30:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-21 17:30:02,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:02,236 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] [2022-11-21 17:30:02,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 17:30:02,237 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:30:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash -853788807, now seen corresponding path program 1 times [2022-11-21 17:30:02,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:02,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415478603] [2022-11-21 17:30:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 17:30:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:30:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415478603] [2022-11-21 17:30:02,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415478603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:30:02,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:30:02,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:30:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440098788] [2022-11-21 17:30:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:30:02,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:30:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:30:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:30:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:30:02,507 INFO L87 Difference]: Start difference. First operand 4742 states and 6191 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2022-11-21 17:30:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:30:03,932 INFO L93 Difference]: Finished difference Result 12113 states and 15717 transitions. [2022-11-21 17:30:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:30:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 85 [2022-11-21 17:30:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:30:03,954 INFO L225 Difference]: With dead ends: 12113 [2022-11-21 17:30:03,954 INFO L226 Difference]: Without dead ends: 11687 [2022-11-21 17:30:03,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:30:03,958 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 427 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:30:03,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 925 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:30:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11687 states. [2022-11-21 17:30:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11687 to 4730. [2022-11-21 17:30:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 4729 states have (on average 1.3066187354620427) internal successors, (6179), 4729 states have internal predecessors, (6179), 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) [2022-11-21 17:30:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 6179 transitions. [2022-11-21 17:30:04,317 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 6179 transitions. Word has length 85 [2022-11-21 17:30:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:04,317 INFO L495 AbstractCegarLoop]: Abstraction has 4730 states and 6179 transitions. [2022-11-21 17:30:04,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2022-11-21 17:30:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 6179 transitions. [2022-11-21 17:30:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 17:30:04,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:04,320 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] [2022-11-21 17:30:04,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 17:30:04,321 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:30:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1873307673, now seen corresponding path program 1 times [2022-11-21 17:30:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:04,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231457928] [2022-11-21 17:30:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:30:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:30:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231457928] [2022-11-21 17:30:04,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231457928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:30:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021208430] [2022-11-21 17:30:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:04,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:30:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:30:04,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:30:04,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:30:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:04,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 17:30:04,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:30:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 17:30:05,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:30:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:30:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021208430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:30:05,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:30:05,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2022-11-21 17:30:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634089875] [2022-11-21 17:30:05,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:30:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:30:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:30:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:30:05,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2022-11-21 17:30:05,325 INFO L87 Difference]: Start difference. First operand 4730 states and 6179 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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) [2022-11-21 17:30:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:30:07,136 INFO L93 Difference]: Finished difference Result 13541 states and 17542 transitions. [2022-11-21 17:30:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 17:30:07,136 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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 [2022-11-21 17:30:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:30:07,153 INFO L225 Difference]: With dead ends: 13541 [2022-11-21 17:30:07,154 INFO L226 Difference]: Without dead ends: 7789 [2022-11-21 17:30:07,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:30:07,160 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 959 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:30:07,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 641 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 17:30:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2022-11-21 17:30:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 6292. [2022-11-21 17:30:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6292 states, 6291 states have (on average 1.2705452233349228) internal successors, (7993), 6291 states have internal predecessors, (7993), 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) [2022-11-21 17:30:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 7993 transitions. [2022-11-21 17:30:07,676 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 7993 transitions. Word has length 86 [2022-11-21 17:30:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:07,676 INFO L495 AbstractCegarLoop]: Abstraction has 6292 states and 7993 transitions. [2022-11-21 17:30:07,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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) [2022-11-21 17:30:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 7993 transitions. [2022-11-21 17:30:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 17:30:07,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:07,680 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] [2022-11-21 17:30:07,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:30:07,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 17:30:07,887 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:30:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -653467681, now seen corresponding path program 1 times [2022-11-21 17:30:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252279333] [2022-11-21 17:30:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:30:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:30:08,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252279333] [2022-11-21 17:30:08,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252279333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:30:08,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549924551] [2022-11-21 17:30:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:08,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:30:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:30:08,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:30:08,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:30:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:08,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 17:30:08,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:30:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 17:30:09,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:30:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:30:09,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549924551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:30:09,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:30:09,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-11-21 17:30:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151843742] [2022-11-21 17:30:09,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:30:09,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:30:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:30:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:30:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-21 17:30:09,776 INFO L87 Difference]: Start difference. First operand 6292 states and 7993 transitions. Second operand has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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) [2022-11-21 17:30:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:30:12,192 INFO L93 Difference]: Finished difference Result 17997 states and 22978 transitions. [2022-11-21 17:30:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:30:12,192 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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 [2022-11-21 17:30:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:30:12,215 INFO L225 Difference]: With dead ends: 17997 [2022-11-21 17:30:12,216 INFO L226 Difference]: Without dead ends: 13372 [2022-11-21 17:30:12,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 166 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-11-21 17:30:12,221 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 1225 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:30:12,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1048 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 17:30:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-11-21 17:30:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 6310. [2022-11-21 17:30:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6310 states, 6309 states have (on average 1.2662862577270566) internal successors, (7989), 6309 states have internal predecessors, (7989), 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) [2022-11-21 17:30:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6310 states to 6310 states and 7989 transitions. [2022-11-21 17:30:12,914 INFO L78 Accepts]: Start accepts. Automaton has 6310 states and 7989 transitions. Word has length 89 [2022-11-21 17:30:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:12,914 INFO L495 AbstractCegarLoop]: Abstraction has 6310 states and 7989 transitions. [2022-11-21 17:30:12,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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) [2022-11-21 17:30:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6310 states and 7989 transitions. [2022-11-21 17:30:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 17:30:12,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:12,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:30:12,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:30:13,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 17:30:13,128 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-21 17:30:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -991925189, now seen corresponding path program 1 times [2022-11-21 17:30:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:13,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891371701] [2022-11-21 17:30:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:30:13,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:30:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:30:13,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:30:13,239 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:30:13,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-11-21 17:30:13,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-11-21 17:30:13,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-11-21 17:30:13,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-11-21 17:30:13,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-11-21 17:30:13,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-11-21 17:30:13,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-11-21 17:30:13,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-11-21 17:30:13,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-11-21 17:30:13,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-11-21 17:30:13,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-11-21 17:30:13,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-11-21 17:30:13,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-11-21 17:30:13,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-11-21 17:30:13,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-11-21 17:30:13,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-11-21 17:30:13,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-11-21 17:30:13,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-11-21 17:30:13,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-11-21 17:30:13,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-11-21 17:30:13,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-11-21 17:30:13,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-11-21 17:30:13,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-11-21 17:30:13,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-11-21 17:30:13,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-11-21 17:30:13,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-11-21 17:30:13,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-11-21 17:30:13,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-11-21 17:30:13,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-11-21 17:30:13,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-11-21 17:30:13,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-11-21 17:30:13,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-11-21 17:30:13,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-11-21 17:30:13,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 17:30:13,255 INFO L444 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] [2022-11-21 17:30:13,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:30:13,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:30:13 BoogieIcfgContainer [2022-11-21 17:30:13,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:30:13,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:30:13,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:30:13,393 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:30:13,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:29:37" (3/4) ... [2022-11-21 17:30:13,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:30:13,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:30:13,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:30:13,512 INFO L158 Benchmark]: Toolchain (without parser) took 36867.06ms. Allocated memory was 176.2MB in the beginning and 660.6MB in the end (delta: 484.4MB). Free memory was 130.5MB in the beginning and 472.0MB in the end (delta: -341.5MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,513 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:30:13,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.39ms. Allocated memory is still 176.2MB. Free memory was 130.1MB in the beginning and 117.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.07ms. Allocated memory is still 176.2MB. Free memory was 117.6MB in the beginning and 114.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,514 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,516 INFO L158 Benchmark]: RCFGBuilder took 726.04ms. Allocated memory is still 176.2MB. Free memory was 112.2MB in the beginning and 90.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,517 INFO L158 Benchmark]: TraceAbstraction took 35545.48ms. Allocated memory was 176.2MB in the beginning and 660.6MB in the end (delta: 484.4MB). Free memory was 89.7MB in the beginning and 479.3MB in the end (delta: -389.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,517 INFO L158 Benchmark]: Witness Printer took 119.51ms. Allocated memory is still 660.6MB. Free memory was 479.3MB in the beginning and 472.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 17:30:13,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.39ms. Allocated memory is still 176.2MB. Free memory was 130.1MB in the beginning and 117.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.07ms. Allocated memory is still 176.2MB. Free memory was 117.6MB in the beginning and 114.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.04ms. Allocated memory is still 176.2MB. Free memory was 112.2MB in the beginning and 90.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35545.48ms. Allocated memory was 176.2MB in the beginning and 660.6MB in the end (delta: 484.4MB). Free memory was 89.7MB in the beginning and 479.3MB in the end (delta: -389.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 119.51ms. Allocated memory is still 660.6MB. Free memory was 479.3MB in the beginning and 472.0MB 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.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r1 << 8U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r2 << 16U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7810 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7810 mSDsluCounter, 11583 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8290 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7240 IncrementalHoareTripleChecker+Invalid, 7728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 3293 mSDtfsCounter, 7240 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 1003 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6310occurred in iteration=27, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 39892 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2373 NumberOfCodeBlocks, 2373 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2577 ConstructedInterpolants, 29 QuantifiedInterpolants, 10696 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1363 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2314/2474 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! [2022-11-21 17:30:13,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9b427d-a9a7-49b9-932b-5f581b4280a2/bin/uautomizer-vX5HgA9Q3a/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)