./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/pnr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/pnr5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN --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 c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- 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-6b4ec56 [2022-11-20 10:56:46,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:56:46,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:56:46,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:56:46,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:56:46,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:56:46,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:56:46,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:56:46,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:56:46,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:56:46,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:56:46,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:56:46,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:56:46,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:56:46,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:56:46,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:56:46,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:56:46,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:56:46,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:56:46,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:56:46,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:56:46,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:56:46,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:56:46,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:56:46,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:56:46,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:56:46,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:56:46,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:56:46,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:56:46,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:56:46,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:56:46,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:56:46,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:56:46,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:56:46,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:56:46,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:56:46,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:56:46,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:56:46,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:56:46,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:56:46,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:56:46,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:56:46,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:56:46,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:56:46,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:56:46,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:56:46,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:56:46,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:56:46,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:56:46,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:56:46,208 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:56:46,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:56:46,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:56:46,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:56:46,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:56:46,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:56:46,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:56:46,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:56:46,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:56:46,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:56:46,217 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:56:46,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:56:46,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:56:46,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:56:46,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:56:46,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:56:46,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:56:46,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:56:46,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:46,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:56:46,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:56:46,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:56:46,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:56:46,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:56:46,222 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:56:46,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:56:46,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:56:46,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/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_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2022-11-20 10:56:46,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:56:46,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:56:46,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:56:46,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:56:46,631 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:56:46,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-tiling/pnr5.c [2022-11-20 10:56:49,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:56:50,049 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:56:50,050 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/sv-benchmarks/c/array-tiling/pnr5.c [2022-11-20 10:56:50,057 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/data/75c530066/9f069bb09448451ebc89f0da22c9cf75/FLAG408656be6 [2022-11-20 10:56:50,072 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/data/75c530066/9f069bb09448451ebc89f0da22c9cf75 [2022-11-20 10:56:50,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:56:50,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:56:50,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:50,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:56:50,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:56:50,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4009c930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50, skipping insertion in model container [2022-11-20 10:56:50,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:56:50,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:56:50,287 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_b8f72549-b716-494a-8cb9-b7a394caa7c2/sv-benchmarks/c/array-tiling/pnr5.c[395,408] [2022-11-20 10:56:50,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:50,330 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:56:50,343 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_b8f72549-b716-494a-8cb9-b7a394caa7c2/sv-benchmarks/c/array-tiling/pnr5.c[395,408] [2022-11-20 10:56:50,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:50,375 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:56:50,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50 WrapperNode [2022-11-20 10:56:50,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:50,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:50,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:56:50,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:56:50,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,427 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 144 [2022-11-20 10:56:50,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:50,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:56:50,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:56:50,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:56:50,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,478 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:56:50,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:56:50,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:56:50,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:56:50,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (1/1) ... [2022-11-20 10:56:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:50,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:56:50,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:56:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:56:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:56:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:56:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:56:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2022-11-20 10:56:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2022-11-20 10:56:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:56:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:56:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:56:50,686 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:56:50,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:56:51,436 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:56:51,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:56:51,445 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:56:51,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:51 BoogieIcfgContainer [2022-11-20 10:56:51,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:56:51,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:56:51,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:56:51,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:56:51,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:56:50" (1/3) ... [2022-11-20 10:56:51,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61bb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:51, skipping insertion in model container [2022-11-20 10:56:51,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:50" (2/3) ... [2022-11-20 10:56:51,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61bb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:51, skipping insertion in model container [2022-11-20 10:56:51,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:51" (3/3) ... [2022-11-20 10:56:51,477 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr5.c [2022-11-20 10:56:51,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:56:51,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-20 10:56:51,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:56:51,579 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;@1444ee6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:56:51,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-20 10:56:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 121 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:56:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:56:51,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:51,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:51,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -655793907, now seen corresponding path program 1 times [2022-11-20 10:56:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:51,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151263229] [2022-11-20 10:56:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:52,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151263229] [2022-11-20 10:56:52,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151263229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:52,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:52,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903940508] [2022-11-20 10:56:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:52,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:56:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:56:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:56:52,295 INFO L87 Difference]: Start difference. First operand has 128 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 121 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:52,555 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2022-11-20 10:56:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:56:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:52,570 INFO L225 Difference]: With dead ends: 256 [2022-11-20 10:56:52,570 INFO L226 Difference]: Without dead ends: 121 [2022-11-20 10:56:52,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:56:52,579 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 373 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:52,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 137 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-20 10:56:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-20 10:56:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.704225352112676) internal successors, (121), 114 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:56:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-11-20 10:56:52,671 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 7 [2022-11-20 10:56:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:52,673 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-11-20 10:56:52,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-11-20 10:56:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:56:52,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:52,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:52,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:56:52,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1891449892, now seen corresponding path program 1 times [2022-11-20 10:56:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:52,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824093310] [2022-11-20 10:56:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:52,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824093310] [2022-11-20 10:56:52,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824093310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:52,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:52,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732113020] [2022-11-20 10:56:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:52,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:52,930 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:53,193 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-20 10:56:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:56:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-20 10:56:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:53,196 INFO L225 Difference]: With dead ends: 129 [2022-11-20 10:56:53,196 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 10:56:53,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:53,198 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:53,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 291 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 10:56:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-20 10:56:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 120 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:56:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-20 10:56:53,223 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 15 [2022-11-20 10:56:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:53,228 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-20 10:56:53,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-20 10:56:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:56:53,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:53,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:53,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:56:53,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 120571727, now seen corresponding path program 1 times [2022-11-20 10:56:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:53,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393151318] [2022-11-20 10:56:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:53,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393151318] [2022-11-20 10:56:53,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393151318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:53,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:53,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170128375] [2022-11-20 10:56:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:53,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:53,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:53,378 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:56:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:53,724 INFO L93 Difference]: Finished difference Result 231 states and 252 transitions. [2022-11-20 10:56:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 10:56:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:53,727 INFO L225 Difference]: With dead ends: 231 [2022-11-20 10:56:53,727 INFO L226 Difference]: Without dead ends: 191 [2022-11-20 10:56:53,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:53,729 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:53,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 133 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:56:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-20 10:56:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-11-20 10:56:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 173 states have internal predecessors, (186), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 10:56:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2022-11-20 10:56:53,751 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 16 [2022-11-20 10:56:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:53,753 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2022-11-20 10:56:53,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:56:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2022-11-20 10:56:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:56:53,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:53,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:53,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:56:53,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -511824847, now seen corresponding path program 1 times [2022-11-20 10:56:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886363506] [2022-11-20 10:56:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:53,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886363506] [2022-11-20 10:56:53,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886363506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:53,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243473424] [2022-11-20 10:56:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:53,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:53,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:53,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:53,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:56:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:53,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:56:53,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:54,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:54,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243473424] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:54,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:56:54,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-20 10:56:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739980232] [2022-11-20 10:56:54,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:56:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:56:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:56:54,104 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 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-11-20 10:56:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:54,691 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-11-20 10:56:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:56:54,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 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 21 [2022-11-20 10:56:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:54,694 INFO L225 Difference]: With dead ends: 213 [2022-11-20 10:56:54,694 INFO L226 Difference]: Without dead ends: 212 [2022-11-20 10:56:54,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:56:54,696 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 239 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:54,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 258 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:56:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-20 10:56:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2022-11-20 10:56:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 147 states have (on average 1.3945578231292517) internal successors, (205), 190 states have internal predecessors, (205), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 10:56:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-11-20 10:56:54,717 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 21 [2022-11-20 10:56:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:54,717 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-11-20 10:56:54,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 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-11-20 10:56:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-11-20 10:56:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:54,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:54,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:54,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 10:56:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:54,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1313299140, now seen corresponding path program 1 times [2022-11-20 10:56:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:54,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428628432] [2022-11-20 10:56:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:56:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428628432] [2022-11-20 10:56:55,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428628432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:55,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:55,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:56:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477453001] [2022-11-20 10:56:55,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:55,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:55,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:55,166 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-20 10:56:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:55,472 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2022-11-20 10:56:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 22 [2022-11-20 10:56:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:55,476 INFO L225 Difference]: With dead ends: 239 [2022-11-20 10:56:55,477 INFO L226 Difference]: Without dead ends: 207 [2022-11-20 10:56:55,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:55,481 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 256 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:55,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 110 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:56:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-20 10:56:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2022-11-20 10:56:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 190 states have internal predecessors, (204), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 10:56:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2022-11-20 10:56:55,524 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 22 [2022-11-20 10:56:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:55,525 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2022-11-20 10:56:55,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-20 10:56:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2022-11-20 10:56:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 10:56:55,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:55,532 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:55,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:56:55,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -100336949, now seen corresponding path program 1 times [2022-11-20 10:56:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:55,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42257523] [2022-11-20 10:56:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:56:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:56:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:56:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:56:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:56:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42257523] [2022-11-20 10:56:55,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42257523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:55,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:55,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199626556] [2022-11-20 10:56:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:55,752 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:56:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:55,991 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-11-20 10:56:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:56:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2022-11-20 10:56:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:55,996 INFO L225 Difference]: With dead ends: 207 [2022-11-20 10:56:55,996 INFO L226 Difference]: Without dead ends: 205 [2022-11-20 10:56:56,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:56,006 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:56,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 221 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-20 10:56:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-20 10:56:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 150 states have (on average 1.38) internal successors, (207), 193 states have internal predecessors, (207), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 10:56:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2022-11-20 10:56:56,035 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 61 [2022-11-20 10:56:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:56,038 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2022-11-20 10:56:56,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:56:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2022-11-20 10:56:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 10:56:56,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:56,045 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:56,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:56:56,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1424092885, now seen corresponding path program 1 times [2022-11-20 10:56:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:56,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875600672] [2022-11-20 10:56:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:56:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:56:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:56:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:56:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:56:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:56:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:56,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875600672] [2022-11-20 10:56:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875600672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:56,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936064485] [2022-11-20 10:56:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:56,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:56,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:56:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:56,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:56:56,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:56:56,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:56:56,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936064485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:56,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:56:56,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-20 10:56:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522060310] [2022-11-20 10:56:56,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:56:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:56:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:56:56,754 INFO L87 Difference]: Start difference. First operand 205 states and 227 transitions. Second operand has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 10 states have internal predecessors, (130), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:56:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:57,300 INFO L93 Difference]: Finished difference Result 280 states and 356 transitions. [2022-11-20 10:56:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:56:57,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 10 states have internal predecessors, (130), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2022-11-20 10:56:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:57,303 INFO L225 Difference]: With dead ends: 280 [2022-11-20 10:56:57,303 INFO L226 Difference]: Without dead ends: 259 [2022-11-20 10:56:57,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:56:57,304 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 201 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:57,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 254 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:56:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-20 10:56:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2022-11-20 10:56:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 states have internal predecessors, (281), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:56:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 313 transitions. [2022-11-20 10:56:57,328 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 313 transitions. Word has length 72 [2022-11-20 10:56:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:57,332 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 313 transitions. [2022-11-20 10:56:57,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 10 states have internal predecessors, (130), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:56:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 313 transitions. [2022-11-20 10:56:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 10:56:57,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:57,338 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:57,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:57,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:57,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1197206545, now seen corresponding path program 1 times [2022-11-20 10:56:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:57,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188629768] [2022-11-20 10:56:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:56:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:56:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:56:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:56:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:56:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:56:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:57,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188629768] [2022-11-20 10:56:57,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188629768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:57,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533814682] [2022-11-20 10:56:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:57,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:57,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:57,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:57,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:56:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:57,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:56:57,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:56:57,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:57,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533814682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:57,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:56:57,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-20 10:56:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243084361] [2022-11-20 10:56:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:57,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:57,922 INFO L87 Difference]: Start difference. First operand 256 states and 313 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:56:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:58,167 INFO L93 Difference]: Finished difference Result 256 states and 313 transitions. [2022-11-20 10:56:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-11-20 10:56:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:58,171 INFO L225 Difference]: With dead ends: 256 [2022-11-20 10:56:58,172 INFO L226 Difference]: Without dead ends: 235 [2022-11-20 10:56:58,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:56:58,177 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 86 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:58,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 198 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-20 10:56:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-20 10:56:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 213 states have (on average 1.1220657276995305) internal successors, (239), 217 states have internal predecessors, (239), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:56:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 271 transitions. [2022-11-20 10:56:58,196 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 271 transitions. Word has length 73 [2022-11-20 10:56:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:58,197 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 271 transitions. [2022-11-20 10:56:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:56:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 271 transitions. [2022-11-20 10:56:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 10:56:58,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:58,199 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:58,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:58,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:58,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash -771537462, now seen corresponding path program 1 times [2022-11-20 10:56:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:58,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124144842] [2022-11-20 10:56:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:56:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:56:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:56:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:56:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:56:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124144842] [2022-11-20 10:56:58,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124144842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164363076] [2022-11-20 10:56:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:58,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:58,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:56:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:58,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:56:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:56:58,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:58,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164363076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:58,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:56:58,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 10:56:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564777859] [2022-11-20 10:56:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:58,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:56:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:56:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:56:58,768 INFO L87 Difference]: Start difference. First operand 235 states and 271 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:56:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:58,973 INFO L93 Difference]: Finished difference Result 235 states and 271 transitions. [2022-11-20 10:56:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2022-11-20 10:56:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:58,976 INFO L225 Difference]: With dead ends: 235 [2022-11-20 10:56:58,976 INFO L226 Difference]: Without dead ends: 234 [2022-11-20 10:56:58,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:56:58,977 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:58,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 171 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-20 10:56:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-20 10:56:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 213 states have (on average 1.107981220657277) internal successors, (236), 216 states have internal predecessors, (236), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:56:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 268 transitions. [2022-11-20 10:56:58,993 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 268 transitions. Word has length 78 [2022-11-20 10:56:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:58,994 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 268 transitions. [2022-11-20 10:56:58,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:56:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-11-20 10:56:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-20 10:56:58,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:58,995 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:59,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:59,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:56:59,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:56:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash 474247274, now seen corresponding path program 1 times [2022-11-20 10:56:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:59,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048129805] [2022-11-20 10:56:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:56:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:56:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:56:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:56:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:56:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:56:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048129805] [2022-11-20 10:56:59,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048129805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087723626] [2022-11-20 10:56:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:59,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:59,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:59,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:56:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:59,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:56:59,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:56:59,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:56:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087723626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:59,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:56:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-11-20 10:56:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682859500] [2022-11-20 10:56:59,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:56:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:56:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:56:59,979 INFO L87 Difference]: Start difference. First operand 234 states and 268 transitions. Second operand has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 24 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:57:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:00,588 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2022-11-20 10:57:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:57:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 24 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 95 [2022-11-20 10:57:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:00,590 INFO L225 Difference]: With dead ends: 272 [2022-11-20 10:57:00,590 INFO L226 Difference]: Without dead ends: 271 [2022-11-20 10:57:00,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 10:57:00,592 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 223 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:00,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 487 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:57:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-20 10:57:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2022-11-20 10:57:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 249 states have (on average 1.0923694779116466) internal successors, (272), 252 states have internal predecessors, (272), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:57:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 304 transitions. [2022-11-20 10:57:00,608 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 304 transitions. Word has length 95 [2022-11-20 10:57:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:00,608 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 304 transitions. [2022-11-20 10:57:00,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 24 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:57:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 304 transitions. [2022-11-20 10:57:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-20 10:57:00,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:00,611 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:00,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:57:00,823 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:57:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:00,824 INFO L85 PathProgramCache]: Analyzing trace with hash 646023976, now seen corresponding path program 2 times [2022-11-20 10:57:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:00,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849435542] [2022-11-20 10:57:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:57:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:57:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:57:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:57:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:57:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 265 proven. 58 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:57:03,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:03,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849435542] [2022-11-20 10:57:03,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849435542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:03,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686090328] [2022-11-20 10:57:03,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:57:03,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:03,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:03,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:57:03,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:57:03,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:57:03,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:57:03,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2022-11-20 10:57:03,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2022-11-20 10:57:03,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686090328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:57:03,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:57:03,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4] total 32 [2022-11-20 10:57:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229949740] [2022-11-20 10:57:03,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:03,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 10:57:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 10:57:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-11-20 10:57:03,787 INFO L87 Difference]: Start difference. First operand 270 states and 304 transitions. Second operand has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 10:57:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:05,385 INFO L93 Difference]: Finished difference Result 336 states and 371 transitions. [2022-11-20 10:57:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:57:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2022-11-20 10:57:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:05,387 INFO L225 Difference]: With dead ends: 336 [2022-11-20 10:57:05,387 INFO L226 Difference]: Without dead ends: 203 [2022-11-20 10:57:05,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 269 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=506, Invalid=2464, Unknown=0, NotChecked=0, Total=2970 [2022-11-20 10:57:05,390 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 834 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:05,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 450 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:57:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-20 10:57:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-11-20 10:57:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 183 states have (on average 1.1038251366120218) internal successors, (202), 185 states have internal predecessors, (202), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:57:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2022-11-20 10:57:05,409 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 131 [2022-11-20 10:57:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:05,410 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2022-11-20 10:57:05,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 10:57:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2022-11-20 10:57:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-20 10:57:05,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:05,416 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:05,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:05,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:57:05,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:57:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 321108287, now seen corresponding path program 1 times [2022-11-20 10:57:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:05,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501239168] [2022-11-20 10:57:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:57:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:57:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:57:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:57:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:57:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:57:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 10:57:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 10:57:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 10:57:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:57:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:57:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 10:57:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-20 10:57:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 10:57:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:57:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-20 10:57:05,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:05,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501239168] [2022-11-20 10:57:05,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501239168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:05,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:05,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989892693] [2022-11-20 10:57:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:05,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:05,872 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:57:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:05,973 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2022-11-20 10:57:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 173 [2022-11-20 10:57:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:05,976 INFO L225 Difference]: With dead ends: 203 [2022-11-20 10:57:05,976 INFO L226 Difference]: Without dead ends: 202 [2022-11-20 10:57:05,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:05,978 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:05,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 91 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-20 10:57:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-11-20 10:57:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 183 states have (on average 1.098360655737705) internal successors, (201), 184 states have internal predecessors, (201), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:57:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 233 transitions. [2022-11-20 10:57:05,992 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 233 transitions. Word has length 173 [2022-11-20 10:57:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:05,993 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 233 transitions. [2022-11-20 10:57:05,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:57:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2022-11-20 10:57:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-20 10:57:05,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:05,997 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:05,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:57:05,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-11-20 10:57:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1379885025, now seen corresponding path program 2 times [2022-11-20 10:57:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867073804] [2022-11-20 10:57:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:57:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:57:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:57:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:57:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 10:57:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:57:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 10:57:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 10:57:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 10:57:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:57:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:57:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 10:57:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-20 10:57:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 10:57:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:57:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 10:57:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2022-11-20 10:57:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867073804] [2022-11-20 10:57:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867073804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865788503] [2022-11-20 10:57:06,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:57:06,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:06,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:06,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:06,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:57:06,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:57:06,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:57:06,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:57:06,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-11-20 10:57:07,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-11-20 10:57:07,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865788503] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:57:07,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:57:07,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 3] total 11 [2022-11-20 10:57:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202842909] [2022-11-20 10:57:07,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:07,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:57:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:57:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:57:07,978 INFO L87 Difference]: Start difference. First operand 202 states and 233 transitions. Second operand has 12 states, 11 states have (on average 12.636363636363637) internal successors, (139), 12 states have internal predecessors, (139), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:57:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:08,210 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2022-11-20 10:57:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:57:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.636363636363637) internal successors, (139), 12 states have internal predecessors, (139), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 184 [2022-11-20 10:57:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:08,211 INFO L225 Difference]: With dead ends: 202 [2022-11-20 10:57:08,211 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:57:08,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:57:08,213 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 375 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:08,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 37 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:57:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:57:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:57:08,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2022-11-20 10:57:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:08,215 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:57:08,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.636363636363637) internal successors, (139), 12 states have internal predecessors, (139), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:57:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:57:08,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:57:08,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2022-11-20 10:57:08,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2022-11-20 10:57:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2022-11-20 10:57:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2022-11-20 10:57:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2022-11-20 10:57:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2022-11-20 10:57:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2022-11-20 10:57:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2022-11-20 10:57:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2022-11-20 10:57:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2022-11-20 10:57:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2022-11-20 10:57:08,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2022-11-20 10:57:08,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2022-11-20 10:57:08,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2022-11-20 10:57:08,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2022-11-20 10:57:08,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2022-11-20 10:57:08,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2022-11-20 10:57:08,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2022-11-20 10:57:08,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2022-11-20 10:57:08,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2022-11-20 10:57:08,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2022-11-20 10:57:08,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2022-11-20 10:57:08,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2022-11-20 10:57:08,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2022-11-20 10:57:08,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2022-11-20 10:57:08,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2022-11-20 10:57:08,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2022-11-20 10:57:08,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2022-11-20 10:57:08,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2022-11-20 10:57:08,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2022-11-20 10:57:08,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2022-11-20 10:57:08,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2022-11-20 10:57:08,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2022-11-20 10:57:08,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2022-11-20 10:57:08,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2022-11-20 10:57:08,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2022-11-20 10:57:08,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2022-11-20 10:57:08,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2022-11-20 10:57:08,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2022-11-20 10:57:08,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2022-11-20 10:57:08,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2022-11-20 10:57:08,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2022-11-20 10:57:08,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2022-11-20 10:57:08,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2022-11-20 10:57:08,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2022-11-20 10:57:08,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2022-11-20 10:57:08,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:08,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 10:57:08,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:57:09,017 INFO L902 garLoopResultBuilder]: At program point ReadFromPortENTRY(lines 12 16) the Hoare annotation is: true [2022-11-20 10:57:09,017 INFO L899 garLoopResultBuilder]: For program point ReadFromPortFINAL(lines 12 16) no Hoare annotation was computed. [2022-11-20 10:57:09,017 INFO L899 garLoopResultBuilder]: For program point ReadFromPortEXIT(lines 12 16) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point L85-2(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,018 INFO L899 garLoopResultBuilder]: For program point L85-3(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 76) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,019 INFO L895 garLoopResultBuilder]: At program point L69-2(lines 69 76) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_main_~i~0#1| 19999) .cse3))) [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 87) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 87) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point L36-5(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point L36-6(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L895 garLoopResultBuilder]: At program point L94(lines 22 95) the Hoare annotation is: (<= ~MAX~0 100000) [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:57:09,020 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L895 garLoopResultBuilder]: At program point L36-7(lines 36 87) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3))) [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point L36-8(lines 36 87) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point L61-2(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,021 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point L45-2(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point L45-3(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 86) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_main_~i~0#1| 19999) .cse3))) [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,023 INFO L899 garLoopResultBuilder]: For program point L5(lines 5 7) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 39 46) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_main_~i~0#1| 19999) .cse3))) [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-20 10:57:09,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L89-3(line 89) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L89-4(line 89) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L895 garLoopResultBuilder]: At program point L89-5(lines 89 92) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-20 10:57:09,026 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L81-2(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L81-3(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,027 INFO L899 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 56) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,028 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 56) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_main_~i~0#1| 19999) .cse3))) [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,029 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2022-11-20 10:57:09,030 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-20 10:57:09,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:57:09,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,032 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-11-20 10:57:09,033 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 93) no Hoare annotation was computed. [2022-11-20 10:57:09,033 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-20 10:57:09,033 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 93) no Hoare annotation was computed. [2022-11-20 10:57:09,033 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,034 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,035 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-20 10:57:09,035 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-20 10:57:09,035 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-20 10:57:09,035 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 66) no Hoare annotation was computed. [2022-11-20 10:57:09,036 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 59 66) the Hoare annotation is: (let ((.cse0 (= ~SIZE~0 (* 5 (div ~SIZE~0 5)))) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (<= ~SIZE~0 99999)) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_main_~i~0#1| 19999) .cse3))) [2022-11-20 10:57:09,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-20 10:57:09,036 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,036 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,036 INFO L899 garLoopResultBuilder]: For program point L51-2(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-20 10:57:09,037 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2022-11-20 10:57:09,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-20 10:57:09,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-20 10:57:09,037 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-11-20 10:57:09,042 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:09,045 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:57:09,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:57:09 BoogieIcfgContainer [2022-11-20 10:57:09,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:57:09,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:57:09,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:57:09,076 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:57:09,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:51" (3/4) ... [2022-11-20 10:57:09,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:57:09,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2022-11-20 10:57:09,099 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-20 10:57:09,099 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:57:09,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:57:09,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:57:09,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:57:09,167 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:57:09,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:57:09,168 INFO L158 Benchmark]: Toolchain (without parser) took 19091.85ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 129.3MB in the beginning and 141.7MB in the end (delta: -12.4MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,168 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 127.9MB. Free memory was 70.8MB in the beginning and 70.7MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:57:09,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.22ms. Allocated memory is still 172.0MB. Free memory was 128.8MB in the beginning and 117.6MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 172.0MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,170 INFO L158 Benchmark]: Boogie Preprocessor took 54.52ms. Allocated memory is still 172.0MB. Free memory was 115.5MB in the beginning and 114.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:57:09,170 INFO L158 Benchmark]: RCFGBuilder took 969.26ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 140.3MB in the end (delta: -26.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,171 INFO L158 Benchmark]: TraceAbstraction took 17605.83ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 141.8MB in the beginning and 145.9MB in the end (delta: -4.1MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,171 INFO L158 Benchmark]: Witness Printer took 91.69ms. Allocated memory is still 249.6MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:09,173 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.26ms. Allocated memory is still 127.9MB. Free memory was 70.8MB in the beginning and 70.7MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.22ms. Allocated memory is still 172.0MB. Free memory was 128.8MB in the beginning and 117.6MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 172.0MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.52ms. Allocated memory is still 172.0MB. Free memory was 115.5MB in the beginning and 114.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 969.26ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 140.3MB in the end (delta: -26.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17605.83ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 141.8MB in the beginning and 145.9MB in the end (delta: -4.1MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Witness Printer took 91.69ms. Allocated memory is still 249.6MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2821 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2776 mSDsluCounter, 2838 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1929 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4069 IncrementalHoareTripleChecker+Invalid, 4504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 909 mSDtfsCounter, 4069 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1421 GetRequests, 1254 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=10, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 69 NumberOfFragments, 306 HoareAnnotationTreeSize, 29 FomulaSimplifications, 386 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 704 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1602 NumberOfCodeBlocks, 1318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2080 ConstructedInterpolants, 0 QuantifiedInterpolants, 7992 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1271 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 3225/3665 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: MAX <= 100000 - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((SIZE == 5 * (SIZE / 5) && 1 <= i) && 2 <= SIZE) && SIZE <= 99999) && MAX <= 100000) || ((((SIZE == 5 * (SIZE / 5) && i == 0) && 2 <= SIZE) && SIZE <= 99999) && MAX <= 100000) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((SIZE == 5 * (SIZE / 5) && 2 <= SIZE) && i == 1) && SIZE <= 99999) && MAX <= 100000) || ((((SIZE == 5 * (SIZE / 5) && 2 <= SIZE) && 2 <= i) && SIZE <= 99999) && MAX <= 100000) RESULT: Ultimate proved your program to be correct! [2022-11-20 10:57:09,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f72549-b716-494a-8cb9-b7a394caa7c2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE