./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 19:23:10,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:23:10,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:23:10,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:23:10,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:23:10,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:23:10,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:23:10,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:23:10,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:23:10,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:23:10,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:23:10,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:23:10,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:23:10,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:23:10,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:23:10,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:23:10,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:23:10,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:23:10,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:23:10,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:23:10,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:23:10,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:23:10,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:23:10,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:23:10,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:23:10,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:23:10,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:23:10,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:23:10,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:23:10,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:23:10,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:23:10,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:23:10,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:23:10,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:23:10,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:23:10,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:23:10,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:23:10,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:23:10,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:23:10,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:23:10,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:23:10,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 19:23:10,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:23:10,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:23:10,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:23:10,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:23:10,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:23:10,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:23:10,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:23:10,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:23:10,225 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:23:10,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:23:10,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:23:10,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:23:10,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:23:10,227 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 19:23:10,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:23:10,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:23:10,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:23:10,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:23:10,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:23:10,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:23:10,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:23:10,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:23:10,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:23:10,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:23:10,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:23:10,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:23:10,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:23:10,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:23:10,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:23:10,230 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:23:10,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:23:10,230 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:23:10,230 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/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_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8 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-12-13 19:23:10,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:23:10,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:23:10,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:23:10,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:23:10,439 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:23:10,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/bitvector/byte_add-2.i [2022-12-13 19:23:13,071 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:23:13,228 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:23:13,229 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/sv-benchmarks/c/bitvector/byte_add-2.i [2022-12-13 19:23:13,234 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/data/3576ddd71/44bae586d0b24584835d788716378ecf/FLAG67eb7dffc [2022-12-13 19:23:13,246 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/data/3576ddd71/44bae586d0b24584835d788716378ecf [2022-12-13 19:23:13,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:23:13,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:23:13,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:23:13,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:23:13,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:23:13,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe37b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13, skipping insertion in model container [2022-12-13 19:23:13,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:23:13,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:23:13,394 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_ae351598-b9c1-4500-a490-d1a7cfa844a3/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-12-13 19:23:13,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:23:13,438 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:23:13,447 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_ae351598-b9c1-4500-a490-d1a7cfa844a3/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-12-13 19:23:13,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:23:13,483 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:23:13,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13 WrapperNode [2022-12-13 19:23:13,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:23:13,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:23:13,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:23:13,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:23:13,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,527 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2022-12-13 19:23:13,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:23:13,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:23:13,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:23:13,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:23:13,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,556 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:23:13,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:23:13,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:23:13,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:23:13,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (1/1) ... [2022-12-13 19:23:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:23:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:13,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:23:13,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:23:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:23:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:23:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:23:13,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:23:13,680 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:23:13,681 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:23:14,007 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:23:14,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:23:14,012 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 19:23:14,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:23:14 BoogieIcfgContainer [2022-12-13 19:23:14,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:23:14,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:23:14,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:23:14,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:23:14,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:23:13" (1/3) ... [2022-12-13 19:23:14,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfdc09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:23:14, skipping insertion in model container [2022-12-13 19:23:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:23:13" (2/3) ... [2022-12-13 19:23:14,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfdc09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:23:14, skipping insertion in model container [2022-12-13 19:23:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:23:14" (3/3) ... [2022-12-13 19:23:14,021 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2022-12-13 19:23:14,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:23:14,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-13 19:23:14,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:23:14,076 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;@103ebf3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:23:14,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-13 19:23:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 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-12-13 19:23:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 19:23:14,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:14,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 19:23:14,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-12-13 19:23:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163458842] [2022-12-13 19:23:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163458842] [2022-12-13 19:23:14,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163458842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:14,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:14,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:23:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159485774] [2022-12-13 19:23:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:14,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:23:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:23:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:23:14,243 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 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-12-13 19:23:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:14,264 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2022-12-13 19:23:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:23:14,266 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-12-13 19:23:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:14,272 INFO L225 Difference]: With dead ends: 153 [2022-12-13 19:23:14,273 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 19:23:14,275 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-12-13 19:23:14,277 INFO L413 NwaCegarLoop]: 116 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, 116 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-12-13 19:23:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:23:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 19:23:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 19:23:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 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-12-13 19:23:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-12-13 19:23:14,309 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2022-12-13 19:23:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:14,309 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-12-13 19:23:14,309 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-12-13 19:23:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-12-13 19:23:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 19:23:14,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:14,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:14,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:23:14,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2022-12-13 19:23:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:14,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894564326] [2022-12-13 19:23:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:14,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894564326] [2022-12-13 19:23:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894564326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:14,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:23:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628414211] [2022-12-13 19:23:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:23:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:23:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:23:14,422 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-13 19:23:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:14,533 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2022-12-13 19:23:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:23:14,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-12-13 19:23:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:14,536 INFO L225 Difference]: With dead ends: 162 [2022-12-13 19:23:14,536 INFO L226 Difference]: Without dead ends: 108 [2022-12-13 19:23:14,536 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-12-13 19:23:14,537 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:14,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-13 19:23:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2022-12-13 19:23:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-13 19:23:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-12-13 19:23:14,545 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2022-12-13 19:23:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:14,545 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-12-13 19:23:14,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-13 19:23:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-12-13 19:23:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 19:23:14,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:14,546 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] [2022-12-13 19:23:14,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:23:14,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2022-12-13 19:23:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:14,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528576588] [2022-12-13 19:23:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:23:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:14,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528576588] [2022-12-13 19:23:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528576588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:14,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:14,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:23:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168450758] [2022-12-13 19:23:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:14,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:23:14,669 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 19:23:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:14,833 INFO L93 Difference]: Finished difference Result 251 states and 338 transitions. [2022-12-13 19:23:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-13 19:23:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:14,834 INFO L225 Difference]: With dead ends: 251 [2022-12-13 19:23:14,834 INFO L226 Difference]: Without dead ends: 184 [2022-12-13 19:23:14,835 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-12-13 19:23:14,835 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 136 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 326 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:14,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 326 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-13 19:23:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 114. [2022-12-13 19:23:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 0 states have call successors, (0), 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-12-13 19:23:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2022-12-13 19:23:14,842 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 24 [2022-12-13 19:23:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:14,842 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2022-12-13 19:23:14,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 19:23:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2022-12-13 19:23:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:23:14,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:14,843 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, 1] [2022-12-13 19:23:14,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:23:14,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1448694967, now seen corresponding path program 1 times [2022-12-13 19:23:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604403916] [2022-12-13 19:23:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:23:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604403916] [2022-12-13 19:23:14,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604403916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:14,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:14,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:23:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805860231] [2022-12-13 19:23:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:23:14,935 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 19:23:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:15,077 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2022-12-13 19:23:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-12-13 19:23:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:15,079 INFO L225 Difference]: With dead ends: 289 [2022-12-13 19:23:15,080 INFO L226 Difference]: Without dead ends: 214 [2022-12-13 19:23:15,080 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-12-13 19:23:15,081 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 144 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 336 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:15,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 336 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-12-13 19:23:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2022-12-13 19:23:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 0 states have call successors, (0), 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-12-13 19:23:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2022-12-13 19:23:15,095 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 27 [2022-12-13 19:23:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:15,095 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2022-12-13 19:23:15,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 19:23:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2022-12-13 19:23:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 19:23:15,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:15,097 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, 1, 1, 1, 1] [2022-12-13 19:23:15,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:23:15,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052269, now seen corresponding path program 1 times [2022-12-13 19:23:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:15,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697071498] [2022-12-13 19:23:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:15,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697071498] [2022-12-13 19:23:15,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697071498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461375650] [2022-12-13 19:23:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:15,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:15,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:23:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:15,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:23:15,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:15,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:15,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461375650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:15,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:15,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 19:23:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392696208] [2022-12-13 19:23:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:15,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:15,332 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-12-13 19:23:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:15,478 INFO L93 Difference]: Finished difference Result 239 states and 340 transitions. [2022-12-13 19:23:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-13 19:23:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:15,480 INFO L225 Difference]: With dead ends: 239 [2022-12-13 19:23:15,480 INFO L226 Difference]: Without dead ends: 185 [2022-12-13 19:23:15,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-12-13 19:23:15,482 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:15,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-13 19:23:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2022-12-13 19:23:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.286624203821656) internal successors, (202), 157 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2022-12-13 19:23:15,494 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 30 [2022-12-13 19:23:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:15,494 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2022-12-13 19:23:15,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-12-13 19:23:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-12-13 19:23:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 19:23:15,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:15,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:15,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:15,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1107213899, now seen corresponding path program 1 times [2022-12-13 19:23:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:15,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539976164] [2022-12-13 19:23:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:15,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:15,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539976164] [2022-12-13 19:23:15,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539976164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:15,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653648638] [2022-12-13 19:23:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:15,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:15,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:23:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:15,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:23:15,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:23:15,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653648638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:15,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 19:23:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141900599] [2022-12-13 19:23:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:15,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:15,896 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-13 19:23:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:16,063 INFO L93 Difference]: Finished difference Result 325 states and 444 transitions. [2022-12-13 19:23:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 37 [2022-12-13 19:23:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:16,065 INFO L225 Difference]: With dead ends: 325 [2022-12-13 19:23:16,065 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 19:23:16,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-12-13 19:23:16,066 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 252 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-12-13 19:23:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 252 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:23:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 19:23:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2022-12-13 19:23:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 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-12-13 19:23:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-12-13 19:23:16,077 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 37 [2022-12-13 19:23:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:16,077 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-12-13 19:23:16,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-13 19:23:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-12-13 19:23:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 19:23:16,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:16,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:16,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:16,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 19:23:16,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -756901417, now seen corresponding path program 1 times [2022-12-13 19:23:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:16,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822141144] [2022-12-13 19:23:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822141144] [2022-12-13 19:23:16,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822141144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888087822] [2022-12-13 19:23:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:16,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:16,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:16,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:16,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:23:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:23:16,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 19:23:20,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:20,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888087822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:20,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:20,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-13 19:23:20,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584477049] [2022-12-13 19:23:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:20,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:20,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2022-12-13 19:23:20,536 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-13 19:23:22,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:24,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:26,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:28,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:30,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:32,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:37,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:39,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:41,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:43,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:45,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:47,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:47,342 INFO L93 Difference]: Finished difference Result 381 states and 510 transitions. [2022-12-13 19:23:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:47,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 44 [2022-12-13 19:23:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:47,344 INFO L225 Difference]: With dead ends: 381 [2022-12-13 19:23:47,344 INFO L226 Difference]: Without dead ends: 248 [2022-12-13 19:23:47,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2022-12-13 19:23:47,345 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:47,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 239 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 13 Unknown, 0 Unchecked, 26.8s Time] [2022-12-13 19:23:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-12-13 19:23:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2022-12-13 19:23:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.267605633802817) internal successors, (270), 213 states have internal predecessors, (270), 0 states have call successors, (0), 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-12-13 19:23:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2022-12-13 19:23:47,351 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 44 [2022-12-13 19:23:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:47,351 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2022-12-13 19:23:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-13 19:23:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2022-12-13 19:23:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 19:23:47,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:47,352 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:47,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:23:47,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:47,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1675390727, now seen corresponding path program 1 times [2022-12-13 19:23:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:47,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692174369] [2022-12-13 19:23:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 19:23:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:47,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692174369] [2022-12-13 19:23:47,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692174369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:47,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:47,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:23:47,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251172848] [2022-12-13 19:23:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:47,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:23:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:23:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:23:47,632 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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-12-13 19:23:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:47,642 INFO L93 Difference]: Finished difference Result 255 states and 315 transitions. [2022-12-13 19:23:47,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:23:47,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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 51 [2022-12-13 19:23:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:47,643 INFO L225 Difference]: With dead ends: 255 [2022-12-13 19:23:47,643 INFO L226 Difference]: Without dead ends: 188 [2022-12-13 19:23:47,643 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-12-13 19:23:47,644 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 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-12-13 19:23:47,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:23:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-13 19:23:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-12-13 19:23:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 187 states have internal predecessors, (236), 0 states have call successors, (0), 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-12-13 19:23:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2022-12-13 19:23:47,648 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 51 [2022-12-13 19:23:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:47,649 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2022-12-13 19:23:47,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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-12-13 19:23:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2022-12-13 19:23:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 19:23:47,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:47,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:47,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:23:47,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash 174943707, now seen corresponding path program 1 times [2022-12-13 19:23:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:47,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573353214] [2022-12-13 19:23:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 19:23:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573353214] [2022-12-13 19:23:47,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573353214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:47,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:47,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:23:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268642637] [2022-12-13 19:23:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:23:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:23:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:23:47,778 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-13 19:23:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:47,932 INFO L93 Difference]: Finished difference Result 534 states and 680 transitions. [2022-12-13 19:23:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:23:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 63 [2022-12-13 19:23:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:47,933 INFO L225 Difference]: With dead ends: 534 [2022-12-13 19:23:47,933 INFO L226 Difference]: Without dead ends: 397 [2022-12-13 19:23:47,934 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-12-13 19:23:47,935 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 184 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 206 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:47,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 206 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-13 19:23:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 228. [2022-12-13 19:23:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.2555066079295154) internal successors, (285), 227 states have internal predecessors, (285), 0 states have call successors, (0), 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-12-13 19:23:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-12-13 19:23:47,945 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 63 [2022-12-13 19:23:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:47,945 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-12-13 19:23:47,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-13 19:23:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-12-13 19:23:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 19:23:47,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:47,947 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, 1, 1, 1, 1] [2022-12-13 19:23:47,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:23:47,947 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash -340799825, now seen corresponding path program 1 times [2022-12-13 19:23:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:47,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682477583] [2022-12-13 19:23:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 19:23:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682477583] [2022-12-13 19:23:48,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682477583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:48,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:48,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:23:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397550829] [2022-12-13 19:23:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:23:48,014 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:48,097 INFO L93 Difference]: Finished difference Result 507 states and 631 transitions. [2022-12-13 19:23:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-12-13 19:23:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:48,098 INFO L225 Difference]: With dead ends: 507 [2022-12-13 19:23:48,098 INFO L226 Difference]: Without dead ends: 330 [2022-12-13 19:23:48,098 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-12-13 19:23:48,099 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 351 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-12-13 19:23:48,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 351 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-12-13 19:23:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2022-12-13 19:23:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 243 states have internal predecessors, (312), 0 states have call successors, (0), 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-12-13 19:23:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2022-12-13 19:23:48,105 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 72 [2022-12-13 19:23:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:48,105 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2022-12-13 19:23:48,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2022-12-13 19:23:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 19:23:48,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:48,106 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, 1, 1, 1, 1] [2022-12-13 19:23:48,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:23:48,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1227237688, now seen corresponding path program 1 times [2022-12-13 19:23:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:48,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113346589] [2022-12-13 19:23:48,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:48,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-12-13 19:23:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:48,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113346589] [2022-12-13 19:23:48,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113346589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:48,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:48,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:23:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288093544] [2022-12-13 19:23:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:48,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:23:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:23:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:48,226 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:48,532 INFO L93 Difference]: Finished difference Result 695 states and 896 transitions. [2022-12-13 19:23:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:23:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:48,533 INFO L225 Difference]: With dead ends: 695 [2022-12-13 19:23:48,534 INFO L226 Difference]: Without dead ends: 497 [2022-12-13 19:23:48,534 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-12-13 19:23:48,534 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 272 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:48,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 250 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:23:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-12-13 19:23:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 398. [2022-12-13 19:23:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2896725440806045) internal successors, (512), 397 states have internal predecessors, (512), 0 states have call successors, (0), 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-12-13 19:23:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 512 transitions. [2022-12-13 19:23:48,545 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 512 transitions. Word has length 76 [2022-12-13 19:23:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:48,545 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 512 transitions. [2022-12-13 19:23:48,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 512 transitions. [2022-12-13 19:23:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 19:23:48,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:48,546 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, 1, 1, 1, 1] [2022-12-13 19:23:48,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:23:48,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1202412060, now seen corresponding path program 1 times [2022-12-13 19:23:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721185798] [2022-12-13 19:23:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 19:23:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721185798] [2022-12-13 19:23:48,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721185798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101878919] [2022-12-13 19:23:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:48,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:48,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:48,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:23:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:48,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:23:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:23:48,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:48,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101878919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:48,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:48,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 19:23:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707435809] [2022-12-13 19:23:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:48,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:23:48,750 INFO L87 Difference]: Start difference. First operand 398 states and 512 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-12-13 19:23:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:48,876 INFO L93 Difference]: Finished difference Result 1072 states and 1374 transitions. [2022-12-13 19:23:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:48,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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 76 [2022-12-13 19:23:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:48,879 INFO L225 Difference]: With dead ends: 1072 [2022-12-13 19:23:48,879 INFO L226 Difference]: Without dead ends: 688 [2022-12-13 19:23:48,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-12-13 19:23:48,881 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 79 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 252 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-12-13 19:23:48,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 252 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-12-13 19:23:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 551. [2022-12-13 19:23:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 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-12-13 19:23:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2022-12-13 19:23:48,910 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 76 [2022-12-13 19:23:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:48,910 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2022-12-13 19:23:48,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-12-13 19:23:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2022-12-13 19:23:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 19:23:48,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:48,912 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, 1, 1, 1, 1] [2022-12-13 19:23:48,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:23:49,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 19:23:49,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -426464219, now seen corresponding path program 1 times [2022-12-13 19:23:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:49,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150243112] [2022-12-13 19:23:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 19:23:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150243112] [2022-12-13 19:23:49,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150243112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:49,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:23:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713340428] [2022-12-13 19:23:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:23:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:23:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:49,251 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:49,589 INFO L93 Difference]: Finished difference Result 1336 states and 1716 transitions. [2022-12-13 19:23:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:23:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:49,591 INFO L225 Difference]: With dead ends: 1336 [2022-12-13 19:23:49,591 INFO L226 Difference]: Without dead ends: 801 [2022-12-13 19:23:49,591 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-12-13 19:23:49,592 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 342 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:49,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 234 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:23:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-12-13 19:23:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 673. [2022-12-13 19:23:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2946428571428572) internal successors, (870), 672 states have internal predecessors, (870), 0 states have call successors, (0), 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-12-13 19:23:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 870 transitions. [2022-12-13 19:23:49,610 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 870 transitions. Word has length 76 [2022-12-13 19:23:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:49,610 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 870 transitions. [2022-12-13 19:23:49,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 870 transitions. [2022-12-13 19:23:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 19:23:49,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:49,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:49,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 19:23:49,612 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1084235769, now seen corresponding path program 1 times [2022-12-13 19:23:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581246610] [2022-12-13 19:23:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 19:23:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:49,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581246610] [2022-12-13 19:23:49,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581246610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:49,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:49,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:23:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766033917] [2022-12-13 19:23:49,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:49,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:23:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:23:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:23:49,680 INFO L87 Difference]: Start difference. First operand 673 states and 870 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:49,725 INFO L93 Difference]: Finished difference Result 1293 states and 1676 transitions. [2022-12-13 19:23:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:23:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-12-13 19:23:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:49,727 INFO L225 Difference]: With dead ends: 1293 [2022-12-13 19:23:49,727 INFO L226 Difference]: Without dead ends: 673 [2022-12-13 19:23:49,728 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-12-13 19:23:49,728 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 175 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-12-13 19:23:49,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:23:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-12-13 19:23:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2022-12-13 19:23:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2619047619047619) internal successors, (848), 672 states have internal predecessors, (848), 0 states have call successors, (0), 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-12-13 19:23:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 848 transitions. [2022-12-13 19:23:49,744 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 848 transitions. Word has length 80 [2022-12-13 19:23:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:49,744 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 848 transitions. [2022-12-13 19:23:49,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 848 transitions. [2022-12-13 19:23:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 19:23:49,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:49,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:49,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 19:23:49,746 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 564827417, now seen corresponding path program 1 times [2022-12-13 19:23:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:49,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997139701] [2022-12-13 19:23:49,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:49,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 19:23:49,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:49,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997139701] [2022-12-13 19:23:49,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997139701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:49,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873996014] [2022-12-13 19:23:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:49,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:49,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:49,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:23:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:49,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 19:23:49,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 19:23:50,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 19:23:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873996014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:23:50,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:23:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2022-12-13 19:23:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897793641] [2022-12-13 19:23:50,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:23:50,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:23:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:23:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:23:50,109 INFO L87 Difference]: Start difference. First operand 673 states and 848 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-12-13 19:23:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:51,749 INFO L93 Difference]: Finished difference Result 4048 states and 4946 transitions. [2022-12-13 19:23:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 19:23:51,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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 81 [2022-12-13 19:23:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:51,758 INFO L225 Difference]: With dead ends: 4048 [2022-12-13 19:23:51,758 INFO L226 Difference]: Without dead ends: 3332 [2022-12-13 19:23:51,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 19:23:51,761 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 625 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:51,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1152 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 19:23:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-12-13 19:23:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 962. [2022-12-13 19:23:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3621227887617064) internal successors, (1309), 961 states have internal predecessors, (1309), 0 states have call successors, (0), 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-12-13 19:23:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1309 transitions. [2022-12-13 19:23:51,801 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1309 transitions. Word has length 81 [2022-12-13 19:23:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1309 transitions. [2022-12-13 19:23:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-12-13 19:23:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1309 transitions. [2022-12-13 19:23:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 19:23:51,803 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:51,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:51,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:52,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 19:23:52,003 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1642726455, now seen corresponding path program 1 times [2022-12-13 19:23:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940990645] [2022-12-13 19:23:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 19:23:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940990645] [2022-12-13 19:23:52,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940990645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:52,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:52,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:23:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579428206] [2022-12-13 19:23:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:52,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:23:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:52,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:23:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:52,132 INFO L87 Difference]: Start difference. First operand 962 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:52,563 INFO L93 Difference]: Finished difference Result 2317 states and 3129 transitions. [2022-12-13 19:23:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:23:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 81 [2022-12-13 19:23:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:52,566 INFO L225 Difference]: With dead ends: 2317 [2022-12-13 19:23:52,566 INFO L226 Difference]: Without dead ends: 1287 [2022-12-13 19:23:52,566 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-12-13 19:23:52,567 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 247 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:52,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 389 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:23:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-12-13 19:23:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1153. [2022-12-13 19:23:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3628472222222223) internal successors, (1570), 1152 states have internal predecessors, (1570), 0 states have call successors, (0), 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-12-13 19:23:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1570 transitions. [2022-12-13 19:23:52,592 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1570 transitions. Word has length 81 [2022-12-13 19:23:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:52,592 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1570 transitions. [2022-12-13 19:23:52,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 19:23:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1570 transitions. [2022-12-13 19:23:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 19:23:52,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:52,594 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:52,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 19:23:52,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -927103410, now seen corresponding path program 1 times [2022-12-13 19:23:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127856459] [2022-12-13 19:23:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:23:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127856459] [2022-12-13 19:23:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127856459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:52,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:52,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:23:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100302118] [2022-12-13 19:23:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:52,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:23:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:23:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:52,718 INFO L87 Difference]: Start difference. First operand 1153 states and 1570 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:53,091 INFO L93 Difference]: Finished difference Result 2633 states and 3566 transitions. [2022-12-13 19:23:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:23:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-12-13 19:23:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:53,094 INFO L225 Difference]: With dead ends: 2633 [2022-12-13 19:23:53,094 INFO L226 Difference]: Without dead ends: 1459 [2022-12-13 19:23:53,095 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-12-13 19:23:53,095 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 308 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:53,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 357 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:23:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-12-13 19:23:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1325. [2022-12-13 19:23:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12-13 19:23:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2022-12-13 19:23:53,123 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 81 [2022-12-13 19:23:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:53,123 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2022-12-13 19:23:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2022-12-13 19:23:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 19:23:53,125 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:53,125 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] [2022-12-13 19:23:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 19:23:53,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2022-12-13 19:23:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:53,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476556522] [2022-12-13 19:23:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 19:23:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:53,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476556522] [2022-12-13 19:23:53,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476556522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:53,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:53,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:23:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647042097] [2022-12-13 19:23:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:53,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:23:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:53,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:23:53,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:23:53,244 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 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-12-13 19:23:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:53,587 INFO L93 Difference]: Finished difference Result 4160 states and 5660 transitions. [2022-12-13 19:23:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:23:53,587 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 84 [2022-12-13 19:23:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:53,593 INFO L225 Difference]: With dead ends: 4160 [2022-12-13 19:23:53,593 INFO L226 Difference]: Without dead ends: 3965 [2022-12-13 19:23:53,594 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-12-13 19:23:53,594 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 279 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:53,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 494 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:23:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-12-13 19:23:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 1325. [2022-12-13 19:23:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12-13 19:23:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2022-12-13 19:23:53,642 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2022-12-13 19:23:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:53,642 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2022-12-13 19:23:53,642 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-12-13 19:23:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2022-12-13 19:23:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 19:23:53,643 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:53,643 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] [2022-12-13 19:23:53,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 19:23:53,643 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 629870863, now seen corresponding path program 1 times [2022-12-13 19:23:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886033874] [2022-12-13 19:23:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 19:23:53,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:53,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886033874] [2022-12-13 19:23:53,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886033874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:53,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:53,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:23:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774046352] [2022-12-13 19:23:53,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:53,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:23:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:23:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:23:53,756 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-12-13 19:23:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:54,135 INFO L93 Difference]: Finished difference Result 4152 states and 5648 transitions. [2022-12-13 19:23:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:23:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 84 [2022-12-13 19:23:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:54,142 INFO L225 Difference]: With dead ends: 4152 [2022-12-13 19:23:54,142 INFO L226 Difference]: Without dead ends: 3948 [2022-12-13 19:23:54,143 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-12-13 19:23:54,143 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 241 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 444 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-12-13 19:23:54,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 444 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:23:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-12-13 19:23:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 1325. [2022-12-13 19:23:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12-13 19:23:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2022-12-13 19:23:54,189 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2022-12-13 19:23:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:54,189 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2022-12-13 19:23:54,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-12-13 19:23:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2022-12-13 19:23:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 19:23:54,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:54,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:54,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 19:23:54,191 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2022-12-13 19:23:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:54,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828668572] [2022-12-13 19:23:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 19:23:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:54,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828668572] [2022-12-13 19:23:54,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828668572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:54,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:54,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:23:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542757491] [2022-12-13 19:23:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:54,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:23:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:23:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:54,352 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 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-12-13 19:23:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:54,896 INFO L93 Difference]: Finished difference Result 5488 states and 7468 transitions. [2022-12-13 19:23:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:23:54,897 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 87 [2022-12-13 19:23:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:54,904 INFO L225 Difference]: With dead ends: 5488 [2022-12-13 19:23:54,905 INFO L226 Difference]: Without dead ends: 5293 [2022-12-13 19:23:54,905 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-12-13 19:23:54,906 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 419 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 836 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-12-13 19:23:54,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 836 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:23:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2022-12-13 19:23:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 1325. [2022-12-13 19:23:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12-13 19:23:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2022-12-13 19:23:54,959 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2022-12-13 19:23:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:54,959 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2022-12-13 19:23:54,959 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-12-13 19:23:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2022-12-13 19:23:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 19:23:54,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:54,960 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:54,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 19:23:54,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2022-12-13 19:23:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859940819] [2022-12-13 19:23:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 19:23:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859940819] [2022-12-13 19:23:55,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859940819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:55,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:55,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:23:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896019746] [2022-12-13 19:23:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:55,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:23:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:55,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:23:55,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:55,102 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:55,707 INFO L93 Difference]: Finished difference Result 5470 states and 7443 transitions. [2022-12-13 19:23:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:23:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-12-13 19:23:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:55,717 INFO L225 Difference]: With dead ends: 5470 [2022-12-13 19:23:55,717 INFO L226 Difference]: Without dead ends: 5266 [2022-12-13 19:23:55,718 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-12-13 19:23:55,719 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 361 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:55,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 734 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:23:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2022-12-13 19:23:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 1325. [2022-12-13 19:23:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12-13 19:23:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2022-12-13 19:23:55,784 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2022-12-13 19:23:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:55,784 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2022-12-13 19:23:55,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2022-12-13 19:23:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 19:23:55,786 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:55,786 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] [2022-12-13 19:23:55,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 19:23:55,786 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2022-12-13 19:23:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:55,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120299021] [2022-12-13 19:23:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 19:23:55,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:55,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120299021] [2022-12-13 19:23:55,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120299021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:55,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177214909] [2022-12-13 19:23:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:55,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:55,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:55,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:55,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:23:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:56,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 19:23:56,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 19:23:56,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 19:23:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177214909] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:23:56,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:23:56,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2022-12-13 19:23:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53280295] [2022-12-13 19:23:56,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:23:56,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:23:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:23:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:23:56,237 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:57,210 INFO L93 Difference]: Finished difference Result 5228 states and 7442 transitions. [2022-12-13 19:23:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 19:23:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-12-13 19:23:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:57,216 INFO L225 Difference]: With dead ends: 5228 [2022-12-13 19:23:57,216 INFO L226 Difference]: Without dead ends: 3920 [2022-12-13 19:23:57,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2022-12-13 19:23:57,218 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 546 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:57,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 547 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 19:23:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2022-12-13 19:23:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 2957. [2022-12-13 19:23:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2956 states have (on average 1.3031123139377536) internal successors, (3852), 2956 states have internal predecessors, (3852), 0 states have call successors, (0), 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-12-13 19:23:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 3852 transitions. [2022-12-13 19:23:57,328 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 3852 transitions. Word has length 87 [2022-12-13 19:23:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:57,328 INFO L495 AbstractCegarLoop]: Abstraction has 2957 states and 3852 transitions. [2022-12-13 19:23:57,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3852 transitions. [2022-12-13 19:23:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 19:23:57,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:57,330 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] [2022-12-13 19:23:57,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:23:57,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:57,531 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2022-12-13 19:23:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:57,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387859034] [2022-12-13 19:23:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 19:23:57,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387859034] [2022-12-13 19:23:57,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387859034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:57,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302738056] [2022-12-13 19:23:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:57,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:57,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:57,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:57,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:23:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:57,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 19:23:57,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 19:23:58,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302738056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:58,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:58,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-13 19:23:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945629485] [2022-12-13 19:23:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:58,004 INFO L87 Difference]: Start difference. First operand 2957 states and 3852 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:58,232 INFO L93 Difference]: Finished difference Result 6268 states and 8145 transitions. [2022-12-13 19:23:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:23:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-12-13 19:23:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:58,237 INFO L225 Difference]: With dead ends: 6268 [2022-12-13 19:23:58,237 INFO L226 Difference]: Without dead ends: 5776 [2022-12-13 19:23:58,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 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-12-13 19:23:58,238 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:58,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 184 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:23:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2022-12-13 19:23:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4767. [2022-12-13 19:23:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4766 states have (on average 1.3054972723457827) internal successors, (6222), 4766 states have internal predecessors, (6222), 0 states have call successors, (0), 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-12-13 19:23:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6222 transitions. [2022-12-13 19:23:58,397 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6222 transitions. Word has length 87 [2022-12-13 19:23:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:58,397 INFO L495 AbstractCegarLoop]: Abstraction has 4767 states and 6222 transitions. [2022-12-13 19:23:58,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:23:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6222 transitions. [2022-12-13 19:23:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 19:23:58,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:58,399 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:58,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:23:58,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:58,600 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2022-12-13 19:23:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:58,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064128976] [2022-12-13 19:23:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 19:23:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064128976] [2022-12-13 19:23:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064128976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:58,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:58,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:23:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566658110] [2022-12-13 19:23:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:58,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:23:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:23:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:58,783 INFO L87 Difference]: Start difference. First operand 4767 states and 6222 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-12-13 19:23:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:59,556 INFO L93 Difference]: Finished difference Result 10852 states and 14189 transitions. [2022-12-13 19:23:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:23:59,563 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 89 [2022-12-13 19:23:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:59,572 INFO L225 Difference]: With dead ends: 10852 [2022-12-13 19:23:59,573 INFO L226 Difference]: Without dead ends: 10596 [2022-12-13 19:23:59,574 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-12-13 19:23:59,574 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 529 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1176 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:59,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1176 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:23:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2022-12-13 19:23:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 4746. [2022-12-13 19:23:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4746 states, 4745 states have (on average 1.3055848261327714) internal successors, (6195), 4745 states have internal predecessors, (6195), 0 states have call successors, (0), 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-12-13 19:23:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4746 states to 4746 states and 6195 transitions. [2022-12-13 19:23:59,795 INFO L78 Accepts]: Start accepts. Automaton has 4746 states and 6195 transitions. Word has length 89 [2022-12-13 19:23:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:59,796 INFO L495 AbstractCegarLoop]: Abstraction has 4746 states and 6195 transitions. [2022-12-13 19:23:59,796 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-12-13 19:23:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4746 states and 6195 transitions. [2022-12-13 19:23:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 19:23:59,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:59,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:59,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 19:23:59,797 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:23:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2022-12-13 19:23:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006766482] [2022-12-13 19:23:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 19:23:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006766482] [2022-12-13 19:23:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006766482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:59,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:23:59,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:23:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368599254] [2022-12-13 19:23:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:23:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:23:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:59,944 INFO L87 Difference]: Start difference. First operand 4746 states and 6195 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:24:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:00,897 INFO L93 Difference]: Finished difference Result 12133 states and 15737 transitions. [2022-12-13 19:24:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:24:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 19:24:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:00,907 INFO L225 Difference]: With dead ends: 12133 [2022-12-13 19:24:00,908 INFO L226 Difference]: Without dead ends: 11703 [2022-12-13 19:24:00,909 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-12-13 19:24:00,909 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 443 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:00,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1005 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 19:24:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2022-12-13 19:24:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 4734. [2022-12-13 19:24:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 1.3063596027889288) internal successors, (6183), 4733 states have internal predecessors, (6183), 0 states have call successors, (0), 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-12-13 19:24:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6183 transitions. [2022-12-13 19:24:01,153 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6183 transitions. Word has length 89 [2022-12-13 19:24:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:01,153 INFO L495 AbstractCegarLoop]: Abstraction has 4734 states and 6183 transitions. [2022-12-13 19:24:01,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:24:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6183 transitions. [2022-12-13 19:24:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 19:24:01,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:01,155 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] [2022-12-13 19:24:01,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 19:24:01,155 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:24:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2022-12-13 19:24:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:01,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051084574] [2022-12-13 19:24:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 19:24:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:01,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051084574] [2022-12-13 19:24:01,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051084574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:24:01,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717770090] [2022-12-13 19:24:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:24:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:24:01,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:24:01,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:24:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:01,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 19:24:01,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:24:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 19:24:01,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:24:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 19:24:01,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717770090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:24:01,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:24:01,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2022-12-13 19:24:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5528691] [2022-12-13 19:24:01,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:24:01,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:24:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:24:01,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:24:01,832 INFO L87 Difference]: Start difference. First operand 4734 states and 6183 transitions. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 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-12-13 19:24:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:02,966 INFO L93 Difference]: Finished difference Result 13569 states and 17570 transitions. [2022-12-13 19:24:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:24:02,967 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 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 90 [2022-12-13 19:24:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:02,976 INFO L225 Difference]: With dead ends: 13569 [2022-12-13 19:24:02,976 INFO L226 Difference]: Without dead ends: 7813 [2022-12-13 19:24:02,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2022-12-13 19:24:02,981 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 848 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:02,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 635 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 19:24:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2022-12-13 19:24:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 6296. [2022-12-13 19:24:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6296 states, 6295 states have (on average 1.270373312152502) internal successors, (7997), 6295 states have internal predecessors, (7997), 0 states have call successors, (0), 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-12-13 19:24:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6296 states to 6296 states and 7997 transitions. [2022-12-13 19:24:03,309 INFO L78 Accepts]: Start accepts. Automaton has 6296 states and 7997 transitions. Word has length 90 [2022-12-13 19:24:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:03,310 INFO L495 AbstractCegarLoop]: Abstraction has 6296 states and 7997 transitions. [2022-12-13 19:24:03,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 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-12-13 19:24:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6296 states and 7997 transitions. [2022-12-13 19:24:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 19:24:03,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:03,311 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, 1, 1] [2022-12-13 19:24:03,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 19:24:03,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 19:24:03,512 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:24:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2022-12-13 19:24:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:03,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399349317] [2022-12-13 19:24:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 19:24:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399349317] [2022-12-13 19:24:03,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399349317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:24:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274418049] [2022-12-13 19:24:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:24:03,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:24:03,680 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:24:03,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:24:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:03,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:24:03,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:24:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 19:24:04,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:24:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 19:24:04,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274418049] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:24:04,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:24:04,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-12-13 19:24:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159975754] [2022-12-13 19:24:04,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:24:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:24:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:24:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:24:04,840 INFO L87 Difference]: Start difference. First operand 6296 states and 7997 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-12-13 19:24:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:07,243 INFO L93 Difference]: Finished difference Result 18021 states and 23002 transitions. [2022-12-13 19:24:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 19:24:07,244 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 93 [2022-12-13 19:24:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:07,253 INFO L225 Difference]: With dead ends: 18021 [2022-12-13 19:24:07,254 INFO L226 Difference]: Without dead ends: 13392 [2022-12-13 19:24:07,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-12-13 19:24:07,257 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1203 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:07,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1157 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 19:24:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2022-12-13 19:24:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 6314. [2022-12-13 19:24:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6314 states, 6313 states have (on average 1.2661175352447331) internal successors, (7993), 6313 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-12-13 19:24:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 7993 transitions. [2022-12-13 19:24:07,595 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 7993 transitions. Word has length 93 [2022-12-13 19:24:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:07,595 INFO L495 AbstractCegarLoop]: Abstraction has 6314 states and 7993 transitions. [2022-12-13 19:24:07,595 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-12-13 19:24:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 7993 transitions. [2022-12-13 19:24:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-13 19:24:07,597 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:07,597 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, 1, 1, 1, 1] [2022-12-13 19:24:07,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 19:24:07,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 19:24:07,798 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:24:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1251242111, now seen corresponding path program 1 times [2022-12-13 19:24:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545320624] [2022-12-13 19:24:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:24:07,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:24:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:24:07,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:24:07,874 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:24:07,875 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2022-12-13 19:24:07,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2022-12-13 19:24:07,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2022-12-13 19:24:07,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2022-12-13 19:24:07,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2022-12-13 19:24:07,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2022-12-13 19:24:07,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 19:24:07,881 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:07,885 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:24:07,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:24:07 BoogieIcfgContainer [2022-12-13 19:24:07,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:24:07,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:24:07,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:24:07,930 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:24:07,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:23:14" (3/4) ... [2022-12-13 19:24:07,932 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:24:07,983 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:24:07,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:24:07,984 INFO L158 Benchmark]: Toolchain (without parser) took 54733.30ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 104.9MB in the beginning and 185.4MB in the end (delta: -80.5MB). Peak memory consumption was 198.1MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,984 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:24:07,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 93.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.71ms. Allocated memory is still 136.3MB. Free memory was 93.0MB in the beginning and 89.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,984 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,985 INFO L158 Benchmark]: RCFGBuilder took 452.36ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 65.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,985 INFO L158 Benchmark]: TraceAbstraction took 53913.36ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 64.4MB in the beginning and 192.7MB in the end (delta: -128.3MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,985 INFO L158 Benchmark]: Witness Printer took 53.02ms. Allocated memory is still 413.1MB. Free memory was 192.7MB in the beginning and 185.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 19:24:07,987 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.15ms. Allocated memory is still 136.3MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 93.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.71ms. Allocated memory is still 136.3MB. Free memory was 93.0MB in the beginning and 89.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.36ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 65.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53913.36ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 64.4MB in the beginning and 192.7MB in the end (delta: -128.3MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 53.02ms. Allocated memory is still 413.1MB. Free memory was 192.7MB in the beginning and 185.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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. - 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, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 7571 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7571 mSDsluCounter, 12397 SdHoareTripleChecker+Invalid, 33.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8921 mSDsCounter, 475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7298 IncrementalHoareTripleChecker+Invalid, 7786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 475 mSolverCounterUnsat, 3476 mSDtfsCounter, 7298 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1298 GetRequests, 1055 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6314occurred 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: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 40068 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2517 NumberOfCodeBlocks, 2517 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2733 ConstructedInterpolants, 29 QuantifiedInterpolants, 10900 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1399 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-12-13 19:24:08,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae351598-b9c1-4500-a490-d1a7cfa844a3/bin/uautomizer-uyxdKDjOR8/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)