./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_65_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R --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 01105db113442005e0bdd0dd2597cc3e4c044a9a9395f4487f7b4264680d799a --- 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-38b53e6 [2022-11-25 17:33:09,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:33:09,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:33:09,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:33:09,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:33:09,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:33:09,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:33:09,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:33:09,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:33:09,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:33:09,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:33:09,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:33:09,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:33:09,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:33:09,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:33:09,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:33:09,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:33:09,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:33:09,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:33:09,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:33:09,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:33:09,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:33:09,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:33:09,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:33:09,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:33:09,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:33:09,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:33:09,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:33:09,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:33:09,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:33:09,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:33:09,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:33:09,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:33:09,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:33:09,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:33:09,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:33:09,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:33:09,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:33:09,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:33:09,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:33:09,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:33:09,479 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 17:33:09,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:33:09,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:33:09,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:33:09,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:33:09,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:33:09,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:33:09,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:33:09,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:33:09,528 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:33:09,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:33:09,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:33:09,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:33:09,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:33:09,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:33:09,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:33:09,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:33:09,531 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:33:09,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:33:09,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:33:09,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:33:09,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:33:09,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:33:09,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:33:09,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:33:09,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:33:09,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:33:09,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:33:09,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:33:09,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:33:09,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:33:09,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:33:09,534 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:33:09,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:33:09,535 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_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/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_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R 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 -> 01105db113442005e0bdd0dd2597cc3e4c044a9a9395f4487f7b4264680d799a [2022-11-25 17:33:09,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:33:09,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:33:09,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:33:09,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:33:09,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:33:09,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_65_good.i [2022-11-25 17:33:13,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:33:13,437 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:33:13,444 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_65_good.i [2022-11-25 17:33:13,470 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/data/edfb09cd9/64a6f0377a92443481a38e0145e8c55e/FLAGcfc152465 [2022-11-25 17:33:13,488 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/data/edfb09cd9/64a6f0377a92443481a38e0145e8c55e [2022-11-25 17:33:13,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:33:13,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:33:13,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:33:13,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:33:13,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:33:13,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:33:13" (1/1) ... [2022-11-25 17:33:13,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25525f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:13, skipping insertion in model container [2022-11-25 17:33:13,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:33:13" (1/1) ... [2022-11-25 17:33:13,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:33:13,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:33:14,001 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:33:14,538 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:33:14,546 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:33:14,551 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:33:14,561 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:33:14,564 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:33:14,602 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:33:14,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:33:14,619 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:33:14,647 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:33:14,740 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:33:14,742 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:33:14,743 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:33:14,746 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:33:14,746 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:33:14,752 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:33:14,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:33:14,866 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:33:14,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14 WrapperNode [2022-11-25 17:33:14,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:33:14,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:33:14,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:33:14,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:33:14,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,962 INFO L138 Inliner]: procedures = 504, calls = 63, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-11-25 17:33:14,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:33:14,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:33:14,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:33:14,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:33:14,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,990 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:14,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:33:14,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:33:14,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:33:14,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:33:14,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (1/1) ... [2022-11-25 17:33:15,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:33:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:33:15,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:33:15,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:33:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 17:33:15,103 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 17:33:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 17:33:15,103 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 17:33:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:33:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-25 17:33:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-25 17:33:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:33:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:33:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 17:33:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:33:15,296 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:33:15,298 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:33:15,539 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:33:15,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:33:15,547 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:33:15,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:15 BoogieIcfgContainer [2022-11-25 17:33:15,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:33:15,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:33:15,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:33:15,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:33:15,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:33:13" (1/3) ... [2022-11-25 17:33:15,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:33:15, skipping insertion in model container [2022-11-25 17:33:15,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:14" (2/3) ... [2022-11-25 17:33:15,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:33:15, skipping insertion in model container [2022-11-25 17:33:15,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:15" (3/3) ... [2022-11-25 17:33:15,559 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_65_good.i [2022-11-25 17:33:15,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:33:15,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 17:33:15,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:33:15,656 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;@41a2805a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:33:15,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 17:33:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:33:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:33:15,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:15,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:15,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash -923272379, now seen corresponding path program 1 times [2022-11-25 17:33:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:15,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193674901] [2022-11-25 17:33:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193674901] [2022-11-25 17:33:16,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193674901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:16,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:33:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401431182] [2022-11-25 17:33:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:16,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:33:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:33:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:33:16,258 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:16,382 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-11-25 17:33:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:33:16,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 17:33:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:16,398 INFO L225 Difference]: With dead ends: 68 [2022-11-25 17:33:16,399 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 17:33:16,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:33:16,411 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:33:16,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 225 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:33:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 17:33:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-25 17:33:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.375) internal successors, (44), 38 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:33:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-11-25 17:33:16,456 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 13 [2022-11-25 17:33:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:16,458 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-11-25 17:33:16,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-11-25 17:33:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:33:16,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:16,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:16,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:33:16,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1442680987, now seen corresponding path program 1 times [2022-11-25 17:33:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:16,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890257916] [2022-11-25 17:33:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890257916] [2022-11-25 17:33:16,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890257916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:16,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:33:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151157639] [2022-11-25 17:33:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:33:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:33:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,549 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:16,572 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-25 17:33:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:33:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-25 17:33:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:16,574 INFO L225 Difference]: With dead ends: 48 [2022-11-25 17:33:16,574 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 17:33:16,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,576 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 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-11-25 17:33:16,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 17:33:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-11-25 17:33:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:33:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-11-25 17:33:16,587 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 14 [2022-11-25 17:33:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:16,587 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-11-25 17:33:16,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-11-25 17:33:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:33:16,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:16,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:16,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:33:16,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1443327419, now seen corresponding path program 1 times [2022-11-25 17:33:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:16,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279887460] [2022-11-25 17:33:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279887460] [2022-11-25 17:33:16,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279887460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:16,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:16,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:33:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320090311] [2022-11-25 17:33:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:16,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:33:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:33:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,689 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:16,720 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-11-25 17:33:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:33:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-25 17:33:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:16,723 INFO L225 Difference]: With dead ends: 47 [2022-11-25 17:33:16,723 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 17:33:16,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,725 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 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-11-25 17:33:16,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 17:33:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-25 17:33:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:33:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-25 17:33:16,734 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 14 [2022-11-25 17:33:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:16,734 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-25 17:33:16,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-25 17:33:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:33:16,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:16,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:16,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:33:16,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1773437715, now seen corresponding path program 1 times [2022-11-25 17:33:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:16,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557688398] [2022-11-25 17:33:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557688398] [2022-11-25 17:33:16,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557688398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:16,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:16,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:33:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254738250] [2022-11-25 17:33:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:16,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:33:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:33:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,823 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:16,837 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-25 17:33:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:33:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-25 17:33:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:16,839 INFO L225 Difference]: With dead ends: 45 [2022-11-25 17:33:16,839 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 17:33:16,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:33:16,841 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:33:16,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 17:33:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-11-25 17:33:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 30 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:33:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-25 17:33:16,850 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 15 [2022-11-25 17:33:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:16,850 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-25 17:33:16,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:33:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-25 17:33:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:33:16,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:16,852 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:16,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:33:16,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash -806440505, now seen corresponding path program 1 times [2022-11-25 17:33:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:16,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040643245] [2022-11-25 17:33:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:33:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040643245] [2022-11-25 17:33:17,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040643245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:17,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:17,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:33:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774311628] [2022-11-25 17:33:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:17,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:33:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:33:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:33:17,041 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:33:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:17,058 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-25 17:33:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:33:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-25 17:33:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:17,060 INFO L225 Difference]: With dead ends: 48 [2022-11-25 17:33:17,060 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 17:33:17,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:33:17,062 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:33:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 17:33:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 17:33:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:33:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-11-25 17:33:17,069 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-11-25 17:33:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:17,070 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-11-25 17:33:17,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:33:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-11-25 17:33:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:33:17,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:17,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:17,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:33:17,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash -253293540, now seen corresponding path program 1 times [2022-11-25 17:33:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:17,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880734602] [2022-11-25 17:33:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:33:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:17,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:17,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880734602] [2022-11-25 17:33:17,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880734602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:17,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:17,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:33:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993510590] [2022-11-25 17:33:17,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:33:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:33:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:33:17,256 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:33:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:17,309 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-11-25 17:33:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:33:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-25 17:33:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:17,311 INFO L225 Difference]: With dead ends: 42 [2022-11-25 17:33:17,311 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 17:33:17,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:33:17,313 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:33:17,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 17:33:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 17:33:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:33:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-11-25 17:33:17,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2022-11-25 17:33:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:17,320 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-11-25 17:33:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:33:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-11-25 17:33:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:33:17,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:33:17,322 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] [2022-11-25 17:33:17,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:33:17,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:33:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1098683807, now seen corresponding path program 1 times [2022-11-25 17:33:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:17,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25780299] [2022-11-25 17:33:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:33:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:33:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:33:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:33:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:17,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25780299] [2022-11-25 17:33:17,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25780299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:17,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:17,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:33:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5585274] [2022-11-25 17:33:17,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:17,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:33:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:17,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:33:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:33:17,484 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:33:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:33:17,506 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-25 17:33:17,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:33:17,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-11-25 17:33:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:33:17,508 INFO L225 Difference]: With dead ends: 30 [2022-11-25 17:33:17,508 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:33:17,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:33:17,512 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 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-11-25 17:33:17,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:33:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:33:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:33:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:33:17,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-11-25 17:33:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:33:17,517 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:33:17,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:33:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:33:17,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:33:17,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 17:33:17,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 17:33:17,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 17:33:17,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 17:33:17,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:33:17,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:33:17,659 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 17:33:17,660 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:33:17,660 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 17:33:17,660 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:33:17,660 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:33:17,660 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 17:33:17,660 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:33:17,661 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,661 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 17:33:17,661 INFO L899 garLoopResultBuilder]: For program point L1563-2(line 1563) no Hoare annotation was computed. [2022-11-25 17:33:17,661 INFO L895 garLoopResultBuilder]: At program point L1555(line 1555) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodG2BSink.offset|) (<= .cse0 0))) [2022-11-25 17:33:17,662 INFO L899 garLoopResultBuilder]: For program point L1555-1(lines 1549 1556) no Hoare annotation was computed. [2022-11-25 17:33:17,662 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 17:33:17,662 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2022-11-25 17:33:17,662 INFO L902 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: true [2022-11-25 17:33:17,662 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-25 17:33:17,662 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,663 INFO L899 garLoopResultBuilder]: For program point L1566(lines 1566 1570) no Hoare annotation was computed. [2022-11-25 17:33:17,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,663 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.base| |ULTIMATE.start_goodB2G_~funcPtr~1#1.base|) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodG2BSink.offset|) (<= |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.offset| |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset|) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset| |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.offset|) (<= .cse0 0) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.base| |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.base|))) [2022-11-25 17:33:17,663 INFO L899 garLoopResultBuilder]: For program point L1564-1(lines 1558 1565) no Hoare annotation was computed. [2022-11-25 17:33:17,664 INFO L895 garLoopResultBuilder]: At program point L1577(lines 1571 1578) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 17:33:17,664 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~101#1|))) (and (<= |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink_~data#1| 1) 0) (<= 0 (+ 2 |##fun~int~TO~VOID_#~101#1|)))) [2022-11-25 17:33:17,665 INFO L895 garLoopResultBuilder]: At program point L1594(line 1594) the Hoare annotation is: (or (and (<= 0 (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink_~data#1| 1073741823)) (<= |#funAddr~CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_rand_multiply_65b_goodB2GSink_~data#1| 1) 0) (<= 0 (+ 2 |##fun~int~TO~VOID_#~101#1|))) (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~101#1|)))) [2022-11-25 17:33:17,665 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~101#1|))) (and (= |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_rand_multiply_65b_goodG2BSink_~data#1| |##fun~int~TO~VOID_#in~101#1|) (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_rand_multiply_65b_goodG2BSink_~data#1| 1) 0) (= |##fun~int~TO~VOID_#~101#1| |##fun~int~TO~VOID_#in~101#1|))) [2022-11-25 17:33:17,666 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-25 17:33:17,666 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-25 17:33:17,666 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,666 INFO L902 garLoopResultBuilder]: At program point ##fun~int~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-25 17:33:17,666 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,666 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-25 17:33:17,667 INFO L899 garLoopResultBuilder]: For program point L1593(line 1593) no Hoare annotation was computed. [2022-11-25 17:33:17,667 INFO L899 garLoopResultBuilder]: For program point L1593-1(line 1593) no Hoare annotation was computed. [2022-11-25 17:33:17,667 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1599) no Hoare annotation was computed. [2022-11-25 17:33:17,667 INFO L899 garLoopResultBuilder]: For program point L1589(lines 1589 1600) no Hoare annotation was computed. [2022-11-25 17:33:17,668 INFO L899 garLoopResultBuilder]: For program point L1587(lines 1587 1601) no Hoare annotation was computed. [2022-11-25 17:33:17,668 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-25 17:33:17,668 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-25 17:33:17,669 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-25 17:33:17,669 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-25 17:33:17,669 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2022-11-25 17:33:17,669 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1586) no Hoare annotation was computed. [2022-11-25 17:33:17,675 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:33:17,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:33:17,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:33:17 BoogieIcfgContainer [2022-11-25 17:33:17,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:33:17,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:33:17,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:33:17,700 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:33:17,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:15" (3/4) ... [2022-11-25 17:33:17,703 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:33:17,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 17:33:17,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 17:33:17,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2022-11-25 17:33:17,714 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 17:33:17,714 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 17:33:17,715 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 17:33:17,715 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:33:17,751 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:33:17,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:33:17,751 INFO L158 Benchmark]: Toolchain (without parser) took 4256.89ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 61.9MB in the end (delta: 73.8MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,752 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.4MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:33:17,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1369.28ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 74.1MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.67ms. Allocated memory is still 169.9MB. Free memory was 74.1MB in the beginning and 70.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,753 INFO L158 Benchmark]: Boogie Preprocessor took 32.17ms. Allocated memory is still 169.9MB. Free memory was 70.8MB in the beginning and 69.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:33:17,753 INFO L158 Benchmark]: RCFGBuilder took 553.13ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 134.9MB in the end (delta: -65.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,753 INFO L158 Benchmark]: TraceAbstraction took 2147.81ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 65.1MB in the end (delta: 68.8MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,754 INFO L158 Benchmark]: Witness Printer took 51.32ms. Allocated memory is still 169.9MB. Free memory was 65.1MB in the beginning and 61.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:33:17,755 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.28ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.4MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1369.28ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 74.1MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.67ms. Allocated memory is still 169.9MB. Free memory was 74.1MB in the beginning and 70.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.17ms. Allocated memory is still 169.9MB. Free memory was 70.8MB in the beginning and 69.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 553.13ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 134.9MB in the end (delta: -65.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2147.81ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 65.1MB in the end (delta: 68.8MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 51.32ms. Allocated memory is still 169.9MB. Free memory was 65.1MB in the beginning and 61.9MB in the end (delta: 3.1MB). 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: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: 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 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 261 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=1, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 29 PreInvPairs, 30 NumberOfFragments, 120 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 25 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 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 4 specifications checked. All of them hold - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: 0 <= data + 2 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:33:17,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c31390f-bac8-4305-bf51-3c040211bc39/bin/uautomizer-ZsLfNo2U6R/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