./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 479865b506db358c4c0b4062b91ef7b3e76c941daf559425e6d3b287e14c2722 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:24:03,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:24:03,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:24:03,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:24:03,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:24:03,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:24:03,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:24:03,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:24:03,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:24:03,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:24:03,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:24:03,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:24:03,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:24:03,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:24:03,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:24:03,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:24:03,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:24:03,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:24:03,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:24:03,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:24:03,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:24:03,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:24:03,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:24:03,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:24:03,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:24:03,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:24:03,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:24:03,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:24:03,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:24:03,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:24:03,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:24:03,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:24:03,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:24:03,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:24:03,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:24:03,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:24:03,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:24:03,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:24:03,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:24:03,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:24:03,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:24:03,392 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 19:24:03,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:24:03,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:24:03,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:24:03,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:24:03,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:24:03,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:24:03,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:24:03,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:24:03,408 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:24:03,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:24:03,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:24:03,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:24:03,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:24:03,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:24:03,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:24:03,411 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 479865b506db358c4c0b4062b91ef7b3e76c941daf559425e6d3b287e14c2722 [2022-12-13 19:24:03,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:24:03,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:24:03,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:24:03,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:24:03,624 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:24:03,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_15_good.i [2022-12-13 19:24:06,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:24:06,540 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:24:06,541 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_15_good.i [2022-12-13 19:24:06,556 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/data/a9195a6a6/f2a15cd4c03644b193bbe49f9f867e76/FLAG1cf4f4b1f [2022-12-13 19:24:06,568 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/data/a9195a6a6/f2a15cd4c03644b193bbe49f9f867e76 [2022-12-13 19:24:06,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:24:06,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:24:06,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:24:06,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:24:06,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:24:06,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:24:06" (1/1) ... [2022-12-13 19:24:06,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338514de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:06, skipping insertion in model container [2022-12-13 19:24:06,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:24:06" (1/1) ... [2022-12-13 19:24:06,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:24:06,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:24:06,873 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 19:24:07,188 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 19:24:07,192 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:24:07,193 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:24:07,195 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:24:07,195 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:24:07,220 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 19:24:07,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:24:07,227 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:24:07,240 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 19:24:07,269 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 19:24:07,270 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:24:07,271 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:24:07,273 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:24:07,273 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:24:07,279 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 19:24:07,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:24:07,363 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:24:07,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07 WrapperNode [2022-12-13 19:24:07,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:24:07,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:24:07,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:24:07,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:24:07,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,401 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2022-12-13 19:24:07,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:24:07,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:24:07,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:24:07,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:24:07,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:24:07,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:24:07,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:24:07,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:24:07,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (1/1) ... [2022-12-13 19:24:07,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:24:07,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:24:07,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:24:07,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:24:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 19:24:07,469 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 19:24:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 19:24:07,469 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 19:24:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:24:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:24:07,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:24:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 19:24:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:24:07,580 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:24:07,581 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:24:07,741 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:24:07,745 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:24:07,746 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:24:07,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:24:07 BoogieIcfgContainer [2022-12-13 19:24:07,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:24:07,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:24:07,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:24:07,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:24:07,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:24:06" (1/3) ... [2022-12-13 19:24:07,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde3946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:24:07, skipping insertion in model container [2022-12-13 19:24:07,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:24:07" (2/3) ... [2022-12-13 19:24:07,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde3946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:24:07, skipping insertion in model container [2022-12-13 19:24:07,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:24:07" (3/3) ... [2022-12-13 19:24:07,753 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_15_good.i [2022-12-13 19:24:07,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:24:07,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 19:24:07,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:24:07,807 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;@55e01435, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:24:07,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 19:24:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 19:24:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 19:24:07,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:07,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:07,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-12-13 19:24:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775385] [2022-12-13 19:24:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:24:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775385] [2022-12-13 19:24:08,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455996390] [2022-12-13 19:24:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,034 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 19:24:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,076 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2022-12-13 19:24:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-12-13 19:24:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,084 INFO L225 Difference]: With dead ends: 198 [2022-12-13 19:24:08,085 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 19:24:08,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,089 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 19:24:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 70. [2022-12-13 19:24:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 states have internal predecessors, (73), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:24:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2022-12-13 19:24:08,121 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 14 [2022-12-13 19:24:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,122 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2022-12-13 19:24:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 19:24:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2022-12-13 19:24:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 19:24:08,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:24:08,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1778434891, now seen corresponding path program 1 times [2022-12-13 19:24:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542237485] [2022-12-13 19:24:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:24:08,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542237485] [2022-12-13 19:24:08,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542237485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105377687] [2022-12-13 19:24:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,173 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 19:24:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,186 INFO L93 Difference]: Finished difference Result 120 states and 168 transitions. [2022-12-13 19:24:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-12-13 19:24:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,187 INFO L225 Difference]: With dead ends: 120 [2022-12-13 19:24:08,187 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 19:24:08,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,188 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 19:24:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 19:24:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.475) internal successors, (59), 55 states have internal predecessors, (59), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 19:24:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-12-13 19:24:08,194 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 15 [2022-12-13 19:24:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,194 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 19:24:08,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 19:24:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2022-12-13 19:24:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 19:24:08,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:24:08,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-12-13 19:24:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705549348] [2022-12-13 19:24:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:24:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705549348] [2022-12-13 19:24:08,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705549348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502359622] [2022-12-13 19:24:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,238 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-13 19:24:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,250 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-12-13 19:24:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-12-13 19:24:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,251 INFO L225 Difference]: With dead ends: 107 [2022-12-13 19:24:08,251 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 19:24:08,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,252 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 19:24:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 19:24:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.45) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 19:24:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-12-13 19:24:08,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 19 [2022-12-13 19:24:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,258 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-12-13 19:24:08,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-13 19:24:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-12-13 19:24:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:24:08,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:24:08,259 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-12-13 19:24:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245182701] [2022-12-13 19:24:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 19:24:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:24:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245182701] [2022-12-13 19:24:08,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245182701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523520322] [2022-12-13 19:24:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,300 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:24:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,313 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-12-13 19:24:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-13 19:24:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,314 INFO L225 Difference]: With dead ends: 107 [2022-12-13 19:24:08,314 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 19:24:08,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,315 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 19:24:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 19:24:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 19:24:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-12-13 19:24:08,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 23 [2022-12-13 19:24:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,320 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-12-13 19:24:08,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:24:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-12-13 19:24:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 19:24:08,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:24:08,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-12-13 19:24:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280864646] [2022-12-13 19:24:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:24:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280864646] [2022-12-13 19:24:08,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280864646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964671650] [2022-12-13 19:24:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,376 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,394 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-12-13 19:24:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-13 19:24:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,396 INFO L225 Difference]: With dead ends: 125 [2022-12-13 19:24:08,396 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 19:24:08,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,397 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 19:24:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2022-12-13 19:24:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 19:24:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-12-13 19:24:08,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 25 [2022-12-13 19:24:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,403 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-12-13 19:24:08,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-12-13 19:24:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 19:24:08,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:24:08,404 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1692472396, now seen corresponding path program 1 times [2022-12-13 19:24:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344744189] [2022-12-13 19:24:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:24:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344744189] [2022-12-13 19:24:08,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344744189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365111754] [2022-12-13 19:24:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,439 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,446 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-12-13 19:24:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-12-13 19:24:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,447 INFO L225 Difference]: With dead ends: 96 [2022-12-13 19:24:08,447 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 19:24:08,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,449 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 19:24:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-13 19:24:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 19:24:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-12-13 19:24:08,453 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 26 [2022-12-13 19:24:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,453 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-12-13 19:24:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-12-13 19:24:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 19:24:08,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,454 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 19:24:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:24:08,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-12-13 19:24:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980210146] [2022-12-13 19:24:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:24:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980210146] [2022-12-13 19:24:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980210146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329092019] [2022-12-13 19:24:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,488 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,495 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-12-13 19:24:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-12-13 19:24:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,497 INFO L225 Difference]: With dead ends: 83 [2022-12-13 19:24:08,497 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 19:24:08,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,498 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 19:24:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-13 19:24:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 43 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:24:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-12-13 19:24:08,503 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 31 [2022-12-13 19:24:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,503 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-12-13 19:24:08,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:24:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-12-13 19:24:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 19:24:08,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:24:08,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-12-13 19:24:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772324189] [2022-12-13 19:24:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772324189] [2022-12-13 19:24:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772324189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:24:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020813200] [2022-12-13 19:24:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,545 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,555 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-12-13 19:24:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-12-13 19:24:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,556 INFO L225 Difference]: With dead ends: 60 [2022-12-13 19:24:08,556 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 19:24:08,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,557 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 19:24:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-12-13 19:24:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.25) internal successors, (45), 42 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:24:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-12-13 19:24:08,562 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 36 [2022-12-13 19:24:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,562 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-12-13 19:24:08,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-12-13 19:24:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 19:24:08,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:24:08,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -801675300, now seen corresponding path program 1 times [2022-12-13 19:24:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38050322] [2022-12-13 19:24:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38050322] [2022-12-13 19:24:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38050322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:24:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855573515] [2022-12-13 19:24:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,614 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,625 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-12-13 19:24:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-12-13 19:24:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,626 INFO L225 Difference]: With dead ends: 67 [2022-12-13 19:24:08,626 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 19:24:08,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,627 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 19:24:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-12-13 19:24:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.25) internal successors, (50), 46 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:24:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-12-13 19:24:08,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 37 [2022-12-13 19:24:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,631 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-12-13 19:24:08,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-12-13 19:24:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 19:24:08,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:24:08,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -799828258, now seen corresponding path program 1 times [2022-12-13 19:24:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431821300] [2022-12-13 19:24:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431821300] [2022-12-13 19:24:08,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431821300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920100114] [2022-12-13 19:24:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,667 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,674 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-12-13 19:24:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-12-13 19:24:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,680 INFO L225 Difference]: With dead ends: 78 [2022-12-13 19:24:08,681 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:24:08,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,681 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:24:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-13 19:24:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:24:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-12-13 19:24:08,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 37 [2022-12-13 19:24:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,686 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-12-13 19:24:08,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-12-13 19:24:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 19:24:08,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,687 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:24:08,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1822720215, now seen corresponding path program 1 times [2022-12-13 19:24:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737666841] [2022-12-13 19:24:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 19:24:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 19:24:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737666841] [2022-12-13 19:24:08,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737666841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328804772] [2022-12-13 19:24:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,737 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:24:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,744 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-12-13 19:24:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-12-13 19:24:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,746 INFO L225 Difference]: With dead ends: 73 [2022-12-13 19:24:08,746 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 19:24:08,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,747 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 19:24:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-12-13 19:24:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:24:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-12-13 19:24:08,751 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 41 [2022-12-13 19:24:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,751 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-12-13 19:24:08,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:24:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-12-13 19:24:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 19:24:08,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:24:08,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-12-13 19:24:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485837999] [2022-12-13 19:24:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485837999] [2022-12-13 19:24:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485837999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524538706] [2022-12-13 19:24:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,785 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,790 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-12-13 19:24:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-12-13 19:24:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,791 INFO L225 Difference]: With dead ends: 61 [2022-12-13 19:24:08,791 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 19:24:08,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,792 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 19:24:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-13 19:24:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:24:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-12-13 19:24:08,795 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 42 [2022-12-13 19:24:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,795 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-12-13 19:24:08,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:24:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-12-13 19:24:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 19:24:08,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 19:24:08,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-12-13 19:24:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14405120] [2022-12-13 19:24:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 19:24:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14405120] [2022-12-13 19:24:08,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14405120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:24:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767422831] [2022-12-13 19:24:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,836 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,842 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-12-13 19:24:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-12-13 19:24:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,843 INFO L225 Difference]: With dead ends: 44 [2022-12-13 19:24:08,843 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 19:24:08,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,844 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 19:24:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-13 19:24:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:24:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-12-13 19:24:08,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 47 [2022-12-13 19:24:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,847 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-12-13 19:24:08,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-12-13 19:24:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 19:24:08,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 19:24:08,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1807677031, now seen corresponding path program 1 times [2022-12-13 19:24:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707113234] [2022-12-13 19:24:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 19:24:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707113234] [2022-12-13 19:24:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707113234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:24:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104298715] [2022-12-13 19:24:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,888 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,894 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-12-13 19:24:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-12-13 19:24:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,895 INFO L225 Difference]: With dead ends: 48 [2022-12-13 19:24:08,895 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 19:24:08,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,896 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 19:24:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-13 19:24:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:24:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-13 19:24:08,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 48 [2022-12-13 19:24:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,899 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-13 19:24:08,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-13 19:24:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 19:24:08,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:24:08,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 19:24:08,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:24:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 258733193, now seen corresponding path program 1 times [2022-12-13 19:24:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539446990] [2022-12-13 19:24:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:24:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 19:24:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 19:24:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 19:24:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:24:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539446990] [2022-12-13 19:24:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539446990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452509773] [2022-12-13 19:24:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,937 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:24:08,939 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-12-13 19:24:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-12-13 19:24:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:24:08,939 INFO L225 Difference]: With dead ends: 47 [2022-12-13 19:24:08,939 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 19:24:08,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,940 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:24:08,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:24:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 19:24:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 19:24:08,941 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-12-13 19:24:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 19:24:08,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-12-13 19:24:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:24:08,941 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 19:24:08,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:24:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 19:24:08,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 19:24:08,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 19:24:08,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 19:24:08,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 19:24:08,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 19:24:08,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 19:24:08,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 19:24:08,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 19:24:08,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 19:24:08,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 19:24:08,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 19:24:09,000 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 19:24:09,000 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-12-13 19:24:09,001 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1673 1680) the Hoare annotation is: true [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-12-13 19:24:09,002 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch99#1| [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: false [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-13 19:24:09,003 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and |ULTIMATE.start_goodG2B1_#t~switch98#1| (<= .cse0 0) (<= 0 .cse0))) [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch93#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-12-13 19:24:09,004 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: false [2022-12-13 19:24:09,004 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-12-13 19:24:09,004 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch99#1| [2022-12-13 19:24:09,004 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch95#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-12-13 19:24:09,005 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch96#1| [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-12-13 19:24:09,005 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-12-13 19:24:09,005 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-12-13 19:24:09,005 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0))) [2022-12-13 19:24:09,005 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-12-13 19:24:09,005 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-12-13 19:24:09,006 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-12-13 19:24:09,006 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-12-13 19:24:09,006 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 19:24:09,007 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-12-13 19:24:09,007 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-12-13 19:24:09,007 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-12-13 19:24:09,007 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-12-13 19:24:09,007 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-12-13 19:24:09,007 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-12-13 19:24:09,007 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: false [2022-12-13 19:24:09,010 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:09,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:24:09,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:24:09 BoogieIcfgContainer [2022-12-13 19:24:09,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:24:09,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:24:09,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:24:09,024 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:24:09,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:24:07" (3/4) ... [2022-12-13 19:24:09,027 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 19:24:09,032 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 19:24:09,032 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 19:24:09,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 19:24:09,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-13 19:24:09,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 19:24:09,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:24:09,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:24:09,066 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:24:09,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:24:09,066 INFO L158 Benchmark]: Toolchain (without parser) took 2495.17ms. Allocated memory is still 144.7MB. Free memory was 105.3MB in the beginning and 90.1MB in the end (delta: 15.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-12-13 19:24:09,066 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 119.5MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 791.62ms. Allocated memory is still 144.7MB. Free memory was 105.3MB in the beginning and 85.2MB in the end (delta: 20.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 144.7MB. Free memory was 85.2MB in the beginning and 81.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: Boogie Preprocessor took 17.55ms. Allocated memory is still 144.7MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: RCFGBuilder took 327.03ms. Allocated memory is still 144.7MB. Free memory was 80.4MB in the beginning and 64.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: TraceAbstraction took 1274.39ms. Allocated memory is still 144.7MB. Free memory was 63.6MB in the beginning and 94.3MB in the end (delta: -30.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:24:09,067 INFO L158 Benchmark]: Witness Printer took 42.38ms. Allocated memory is still 144.7MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:24:09,068 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.11ms. Allocated memory is still 119.5MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 791.62ms. Allocated memory is still 144.7MB. Free memory was 105.3MB in the beginning and 85.2MB in the end (delta: 20.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 144.7MB. Free memory was 85.2MB in the beginning and 81.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.55ms. Allocated memory is still 144.7MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.03ms. Allocated memory is still 144.7MB. Free memory was 80.4MB in the beginning and 64.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1274.39ms. Allocated memory is still 144.7MB. Free memory was 63.6MB in the beginning and 94.3MB in the end (delta: -30.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 42.38ms. Allocated memory is still 144.7MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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 3 procedures, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 1831 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 866 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 965 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 104 PreInvPairs, 124 NumberOfFragments, 72 HoareAnnotationTreeSize, 104 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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 8 specifications checked. All of them hold - InvariantResult [Line: 1616]: Loop Invariant Derived loop invariant: (aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux && 2 + data <= 0) && 0 <= 2 + data - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: 0 <= data + 2 && data + 2 <= 0 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2022-12-13 19:24:09,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c27ec3-094b-4810-8af5-a697e8c4e693/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE