./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:57:05,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:57:05,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:57:05,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:57:05,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:57:05,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:57:05,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:57:05,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:57:05,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:57:05,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:57:05,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:57:05,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:57:05,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:57:05,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:57:05,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:57:05,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:57:05,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:57:05,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:57:05,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:57:05,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:57:05,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:57:05,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:57:05,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:57:05,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:57:05,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:57:05,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:57:05,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:57:05,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:57:05,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:57:05,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:57:05,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:57:05,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:57:05,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:57:05,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:57:05,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:57:05,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:57:05,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:57:05,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:57:05,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:57:05,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:57:05,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:57:05,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-06 20:57:05,494 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:57:05,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:57:05,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:57:05,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:57:05,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:57:05,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:57:05,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:57:05,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:57:05,496 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:57:05,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:57:05,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:57:05,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 20:57:05,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:57:05,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:57:05,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:57:05,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:57:05,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:57:05,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:57:05,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:57:05,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:57:05,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:57:05,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:57:05,500 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:57:05,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/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_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2021-12-06 20:57:05,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:57:05,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:57:05,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:57:05,725 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:57:05,726 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:57:05,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2021-12-06 20:57:05,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/data/a71ae8823/fbc173252ca94ffb84e4a57a91d367a2/FLAGf44b2d5d4 [2021-12-06 20:57:06,153 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:57:06,154 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2021-12-06 20:57:06,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/data/a71ae8823/fbc173252ca94ffb84e4a57a91d367a2/FLAGf44b2d5d4 [2021-12-06 20:57:06,173 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/data/a71ae8823/fbc173252ca94ffb84e4a57a91d367a2 [2021-12-06 20:57:06,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:57:06,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:57:06,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:57:06,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:57:06,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:57:06,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dc0cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06, skipping insertion in model container [2021-12-06 20:57:06,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:57:06,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:57:06,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c[727,740] [2021-12-06 20:57:06,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:57:06,371 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:57:06,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c[727,740] [2021-12-06 20:57:06,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:57:06,424 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:57:06,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06 WrapperNode [2021-12-06 20:57:06,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:57:06,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:57:06,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:57:06,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:57:06,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,456 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2021-12-06 20:57:06,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:57:06,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:57:06,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:57:06,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:57:06,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:57:06,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:57:06,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:57:06,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:57:06,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (1/1) ... [2021-12-06 20:57:06,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:57:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:06,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:57:06,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:57:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:57:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:57:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-06 20:57:06,537 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-06 20:57:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:57:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:57:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 20:57:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 20:57:06,592 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:57:06,593 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:57:06,813 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:57:06,821 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:57:06,821 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-06 20:57:06,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:57:06 BoogieIcfgContainer [2021-12-06 20:57:06,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:57:06,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:57:06,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:57:06,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:57:06,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:57:06" (1/3) ... [2021-12-06 20:57:06,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b465dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:57:06, skipping insertion in model container [2021-12-06 20:57:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:57:06" (2/3) ... [2021-12-06 20:57:06,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b465dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:57:06, skipping insertion in model container [2021-12-06 20:57:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:57:06" (3/3) ... [2021-12-06 20:57:06,831 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2021-12-06 20:57:06,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:57:06,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2021-12-06 20:57:06,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:57:06,880 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 20:57:06,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2021-12-06 20:57:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 88 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-06 20:57:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 20:57:06,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:06,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:06,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1894792754, now seen corresponding path program 1 times [2021-12-06 20:57:06,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:06,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185148794] [2021-12-06 20:57:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:06,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185148794] [2021-12-06 20:57:07,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185148794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:57:07,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009063740] [2021-12-06 20:57:07,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 20:57:07,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 20:57:07,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 20:57:07,061 INFO L87 Difference]: Start difference. First operand has 95 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 88 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,086 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2021-12-06 20:57:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 20:57:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 20:57:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,095 INFO L225 Difference]: With dead ends: 185 [2021-12-06 20:57:07,095 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 20:57:07,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 20:57:07,101 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 20:57:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-06 20:57:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2021-12-06 20:57:07,135 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 9 [2021-12-06 20:57:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,135 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2021-12-06 20:57:07,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2021-12-06 20:57:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 20:57:07,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:57:07,137 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1895734020, now seen corresponding path program 1 times [2021-12-06 20:57:07,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108800155] [2021-12-06 20:57:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108800155] [2021-12-06 20:57:07,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108800155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:57:07,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500919599] [2021-12-06 20:57:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:57:07,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:57:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:57:07,191 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,275 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2021-12-06 20:57:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:57:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 20:57:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,279 INFO L225 Difference]: With dead ends: 197 [2021-12-06 20:57:07,279 INFO L226 Difference]: Without dead ends: 123 [2021-12-06 20:57:07,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,282 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 225 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:57:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-06 20:57:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2021-12-06 20:57:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 104 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2021-12-06 20:57:07,302 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 9 [2021-12-06 20:57:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,303 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2021-12-06 20:57:07,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2021-12-06 20:57:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-06 20:57:07,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:57:07,305 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 456021693, now seen corresponding path program 1 times [2021-12-06 20:57:07,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037541283] [2021-12-06 20:57:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037541283] [2021-12-06 20:57:07,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037541283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:07,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826116183] [2021-12-06 20:57:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:57:07,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:57:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:57:07,364 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,404 INFO L93 Difference]: Finished difference Result 224 states and 276 transitions. [2021-12-06 20:57:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:57:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-06 20:57:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,406 INFO L225 Difference]: With dead ends: 224 [2021-12-06 20:57:07,406 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 20:57:07,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,409 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 20:57:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-06 20:57:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 108 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2021-12-06 20:57:07,423 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 12 [2021-12-06 20:57:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,423 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2021-12-06 20:57:07,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:57:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2021-12-06 20:57:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 20:57:07,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,425 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:57:07,425 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash -338403669, now seen corresponding path program 1 times [2021-12-06 20:57:07,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242059935] [2021-12-06 20:57:07,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242059935] [2021-12-06 20:57:07,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242059935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:07,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478984652] [2021-12-06 20:57:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:57:07,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:57:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:57:07,476 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 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) [2021-12-06 20:57:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,507 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2021-12-06 20:57:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:57:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 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 19 [2021-12-06 20:57:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,509 INFO L225 Difference]: With dead ends: 202 [2021-12-06 20:57:07,510 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 20:57:07,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,512 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 248 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 20:57:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-06 20:57:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 94 states have internal predecessors, (112), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2021-12-06 20:57:07,523 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 19 [2021-12-06 20:57:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,523 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2021-12-06 20:57:07,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 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) [2021-12-06 20:57:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2021-12-06 20:57:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 20:57:07,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,525 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:57:07,525 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -104572203, now seen corresponding path program 1 times [2021-12-06 20:57:07,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527564824] [2021-12-06 20:57:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527564824] [2021-12-06 20:57:07,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527564824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:07,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217091619] [2021-12-06 20:57:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:57:07,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:57:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,574 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 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) [2021-12-06 20:57:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,624 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2021-12-06 20:57:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:57:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 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 20 [2021-12-06 20:57:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,626 INFO L225 Difference]: With dead ends: 111 [2021-12-06 20:57:07,626 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 20:57:07,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:57:07,628 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 300 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 20:57:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-06 20:57:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 94 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2021-12-06 20:57:07,638 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 20 [2021-12-06 20:57:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,639 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2021-12-06 20:57:07,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 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) [2021-12-06 20:57:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2021-12-06 20:57:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 20:57:07,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,640 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:57:07,640 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1053229104, now seen corresponding path program 1 times [2021-12-06 20:57:07,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407213453] [2021-12-06 20:57:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:57:07,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407213453] [2021-12-06 20:57:07,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407213453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:07,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491657077] [2021-12-06 20:57:07,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:57:07,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:57:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,684 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2021-12-06 20:57:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,733 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2021-12-06 20:57:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:57:07,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 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 21 [2021-12-06 20:57:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,734 INFO L225 Difference]: With dead ends: 196 [2021-12-06 20:57:07,734 INFO L226 Difference]: Without dead ends: 121 [2021-12-06 20:57:07,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:57:07,735 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 303 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-06 20:57:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2021-12-06 20:57:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.411764705882353) internal successors, (120), 104 states have internal predecessors, (120), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-12-06 20:57:07,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 21 [2021-12-06 20:57:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,743 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-06 20:57:07,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2021-12-06 20:57:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2021-12-06 20:57:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 20:57:07,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,744 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:57:07,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -127840962, now seen corresponding path program 1 times [2021-12-06 20:57:07,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333523941] [2021-12-06 20:57:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:57:07,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333523941] [2021-12-06 20:57:07,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333523941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:57:07,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009395227] [2021-12-06 20:57:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:57:07,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:57:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:57:07,788 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-06 20:57:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,820 INFO L93 Difference]: Finished difference Result 127 states and 148 transitions. [2021-12-06 20:57:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:57:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 26 [2021-12-06 20:57:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,822 INFO L225 Difference]: With dead ends: 127 [2021-12-06 20:57:07,822 INFO L226 Difference]: Without dead ends: 124 [2021-12-06 20:57:07,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:57:07,823 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-06 20:57:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2021-12-06 20:57:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 101 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2021-12-06 20:57:07,833 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 26 [2021-12-06 20:57:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,833 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-12-06 20:57:07,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-06 20:57:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2021-12-06 20:57:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 20:57:07,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,835 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:57:07,835 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1958605165, now seen corresponding path program 1 times [2021-12-06 20:57:07,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687718289] [2021-12-06 20:57:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:57:07,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687718289] [2021-12-06 20:57:07,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687718289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:07,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:07,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:07,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564008442] [2021-12-06 20:57:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:57:07,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:57:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:07,897 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:07,951 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2021-12-06 20:57:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:57:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2021-12-06 20:57:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:07,954 INFO L225 Difference]: With dead ends: 156 [2021-12-06 20:57:07,954 INFO L226 Difference]: Without dead ends: 153 [2021-12-06 20:57:07,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:57:07,955 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:07,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 233 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-06 20:57:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2021-12-06 20:57:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 129 states have internal predecessors, (157), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2021-12-06 20:57:07,967 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 34 [2021-12-06 20:57:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:07,967 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2021-12-06 20:57:07,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2021-12-06 20:57:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:57:07,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:07,969 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:07,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:57:07,970 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1911337813, now seen corresponding path program 1 times [2021-12-06 20:57:07,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:07,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178984073] [2021-12-06 20:57:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:07,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:57:08,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178984073] [2021-12-06 20:57:08,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178984073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:08,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:08,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:57:08,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027641] [2021-12-06 20:57:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:08,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:57:08,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:57:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:08,023 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:08,072 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2021-12-06 20:57:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:57:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-12-06 20:57:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:08,073 INFO L225 Difference]: With dead ends: 151 [2021-12-06 20:57:08,073 INFO L226 Difference]: Without dead ends: 148 [2021-12-06 20:57:08,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:57:08,074 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 95 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:08,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 247 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-06 20:57:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2021-12-06 20:57:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 124 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2021-12-06 20:57:08,080 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2021-12-06 20:57:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:08,080 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2021-12-06 20:57:08,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2021-12-06 20:57:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 20:57:08,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:08,082 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:08,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:57:08,082 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -875976532, now seen corresponding path program 1 times [2021-12-06 20:57:08,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:08,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879860130] [2021-12-06 20:57:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:08,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:08,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879860130] [2021-12-06 20:57:08,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879860130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:57:08,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:57:08,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:57:08,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318246491] [2021-12-06 20:57:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:57:08,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:57:08,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:57:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:57:08,145 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:08,197 INFO L93 Difference]: Finished difference Result 310 states and 363 transitions. [2021-12-06 20:57:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:57:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-06 20:57:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:08,199 INFO L225 Difference]: With dead ends: 310 [2021-12-06 20:57:08,199 INFO L226 Difference]: Without dead ends: 202 [2021-12-06 20:57:08,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:57:08,200 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:08,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 271 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:57:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-06 20:57:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 133. [2021-12-06 20:57:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 124 states have internal predecessors, (147), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2021-12-06 20:57:08,208 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 37 [2021-12-06 20:57:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:08,208 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2021-12-06 20:57:08,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2021-12-06 20:57:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 20:57:08,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:08,210 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:08,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:57:08,210 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1872710945, now seen corresponding path program 1 times [2021-12-06 20:57:08,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791001786] [2021-12-06 20:57:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:08,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:08,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:08,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791001786] [2021-12-06 20:57:08,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791001786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:08,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997973095] [2021-12-06 20:57:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:08,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:08,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:08,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:08,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:57:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 20:57:08,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:08,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:08,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997973095] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:08,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:08,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-06 20:57:08,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989213545] [2021-12-06 20:57:08,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:08,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:57:08,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:57:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:57:08,536 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:08,737 INFO L93 Difference]: Finished difference Result 514 states and 602 transitions. [2021-12-06 20:57:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 20:57:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-12-06 20:57:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:08,740 INFO L225 Difference]: With dead ends: 514 [2021-12-06 20:57:08,740 INFO L226 Difference]: Without dead ends: 408 [2021-12-06 20:57:08,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2021-12-06 20:57:08,742 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 325 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:08,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 246 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:57:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-06 20:57:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 153. [2021-12-06 20:57:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 144 states have internal predecessors, (171), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2021-12-06 20:57:08,759 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 39 [2021-12-06 20:57:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:08,759 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2021-12-06 20:57:08,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2021-12-06 20:57:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 20:57:08,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:08,761 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:08,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:57:08,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 20:57:08,964 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1837884998, now seen corresponding path program 1 times [2021-12-06 20:57:08,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086860728] [2021-12-06 20:57:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:08,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:08,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:09,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086860728] [2021-12-06 20:57:09,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086860728] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268791464] [2021-12-06 20:57:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:09,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:09,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:09,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:09,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:57:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:09,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 20:57:09,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:09,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:09,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268791464] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:09,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:09,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-12-06 20:57:09,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585248122] [2021-12-06 20:57:09,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:09,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 20:57:09,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 20:57:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:57:09,302 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 20:57:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:09,548 INFO L93 Difference]: Finished difference Result 418 states and 489 transitions. [2021-12-06 20:57:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:57:09,549 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-12-06 20:57:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:09,551 INFO L225 Difference]: With dead ends: 418 [2021-12-06 20:57:09,551 INFO L226 Difference]: Without dead ends: 302 [2021-12-06 20:57:09,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2021-12-06 20:57:09,552 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 194 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:09,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 436 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:57:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-12-06 20:57:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 153. [2021-12-06 20:57:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.31496062992126) internal successors, (167), 144 states have internal predecessors, (167), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2021-12-06 20:57:09,566 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 42 [2021-12-06 20:57:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:09,567 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2021-12-06 20:57:09,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 20:57:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2021-12-06 20:57:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 20:57:09,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:09,568 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:09,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:57:09,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 20:57:09,770 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:09,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -826675551, now seen corresponding path program 2 times [2021-12-06 20:57:09,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:09,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889568459] [2021-12-06 20:57:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:09,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:09,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889568459] [2021-12-06 20:57:09,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889568459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:09,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534690497] [2021-12-06 20:57:09,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 20:57:09,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:09,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:09,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:09,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:57:10,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 20:57:10,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:57:10,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 20:57:10,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:10,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:10,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534690497] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:10,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:10,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-06 20:57:10,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925565544] [2021-12-06 20:57:10,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:10,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 20:57:10,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 20:57:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:57:10,399 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:10,861 INFO L93 Difference]: Finished difference Result 830 states and 978 transitions. [2021-12-06 20:57:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-06 20:57:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2021-12-06 20:57:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:10,866 INFO L225 Difference]: With dead ends: 830 [2021-12-06 20:57:10,866 INFO L226 Difference]: Without dead ends: 724 [2021-12-06 20:57:10,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2021-12-06 20:57:10,869 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 742 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:10,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 421 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:57:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-12-06 20:57:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 193. [2021-12-06 20:57:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 184 states have internal predecessors, (215), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 223 transitions. [2021-12-06 20:57:10,891 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 223 transitions. Word has length 59 [2021-12-06 20:57:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:10,891 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 223 transitions. [2021-12-06 20:57:10,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 223 transitions. [2021-12-06 20:57:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:57:10,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:10,893 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:10,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 20:57:11,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 20:57:11,093 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -293337030, now seen corresponding path program 2 times [2021-12-06 20:57:11,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:11,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160382780] [2021-12-06 20:57:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:11,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:11,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160382780] [2021-12-06 20:57:11,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160382780] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562096087] [2021-12-06 20:57:11,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 20:57:11,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:11,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:11,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 20:57:11,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 20:57:11,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:57:11,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 20:57:11,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:11,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:11,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562096087] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:11,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:11,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-06 20:57:11,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85455795] [2021-12-06 20:57:11,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:11,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 20:57:11,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 20:57:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2021-12-06 20:57:11,679 INFO L87 Difference]: Start difference. First operand 193 states and 223 transitions. Second operand has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 20:57:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:31,490 INFO L93 Difference]: Finished difference Result 602 states and 709 transitions. [2021-12-06 20:57:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 20:57:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2021-12-06 20:57:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:31,493 INFO L225 Difference]: With dead ends: 602 [2021-12-06 20:57:31,493 INFO L226 Difference]: Without dead ends: 486 [2021-12-06 20:57:31,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=500, Invalid=902, Unknown=4, NotChecked=0, Total=1406 [2021-12-06 20:57:31,495 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 521 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:31,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 1176 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:57:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-12-06 20:57:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 193. [2021-12-06 20:57:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.2395209580838322) internal successors, (207), 184 states have internal predecessors, (207), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2021-12-06 20:57:31,507 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 62 [2021-12-06 20:57:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:31,507 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2021-12-06 20:57:31,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 20:57:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2021-12-06 20:57:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-06 20:57:31,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:31,508 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:31,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 20:57:31,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:31,709 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash -470814303, now seen corresponding path program 3 times [2021-12-06 20:57:31,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941656430] [2021-12-06 20:57:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:31,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:32,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941656430] [2021-12-06 20:57:32,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941656430] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219107548] [2021-12-06 20:57:32,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 20:57:32,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:32,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:32,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 20:57:32,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-12-06 20:57:32,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:57:32,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 20:57:32,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:32,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:32,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219107548] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:32,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:32,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2021-12-06 20:57:32,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271480757] [2021-12-06 20:57:32,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:32,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 20:57:32,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 20:57:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 20:57:32,884 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:57:33,988 INFO L93 Difference]: Finished difference Result 1462 states and 1730 transitions. [2021-12-06 20:57:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-12-06 20:57:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2021-12-06 20:57:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:57:33,994 INFO L225 Difference]: With dead ends: 1462 [2021-12-06 20:57:33,994 INFO L226 Difference]: Without dead ends: 1356 [2021-12-06 20:57:33,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2021-12-06 20:57:33,997 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 1385 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:57:33,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1385 Valid, 775 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:57:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-12-06 20:57:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 273. [2021-12-06 20:57:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 264 states have internal predecessors, (303), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 20:57:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 311 transitions. [2021-12-06 20:57:34,024 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 311 transitions. Word has length 99 [2021-12-06 20:57:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:57:34,024 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 311 transitions. [2021-12-06 20:57:34,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:57:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 311 transitions. [2021-12-06 20:57:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-06 20:57:34,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:57:34,025 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:57:34,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 20:57:34,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 20:57:34,226 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 20:57:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:57:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1189815610, now seen corresponding path program 3 times [2021-12-06 20:57:34,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:57:34,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800624988] [2021-12-06 20:57:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:57:34,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:57:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:34,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:57:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 20:57:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:34,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:57:34,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800624988] [2021-12-06 20:57:34,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800624988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:34,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614596060] [2021-12-06 20:57:34,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 20:57:34,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:57:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:57:34,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:57:34,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 20:57:35,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-12-06 20:57:35,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:57:35,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 20:57:35,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:36,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:57:52,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614596060] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:57:52,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:57:52,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 51 [2021-12-06 20:57:52,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17914730] [2021-12-06 20:57:52,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:52,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-06 20:57:52,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:57:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-06 20:57:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1874, Unknown=3, NotChecked=0, Total=2550 [2021-12-06 20:57:52,123 INFO L87 Difference]: Start difference. First operand 273 states and 311 transitions. Second operand has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 20:58:15,402 WARN L227 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 63 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 20:58:17,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:19,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:21,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:37,525 WARN L227 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 58 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 20:58:51,677 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 57 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 20:58:53,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:55,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:57,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:58:58,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:59:00,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:59:02,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:59:17,310 WARN L227 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 52 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 20:59:34,796 WARN L227 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 51 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 20:59:38,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 20:59:40,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:02,447 WARN L227 SmtUtils]: Spent 13.84s on a formula simplification. DAG size of input: 45 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:00:04,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:06,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:08,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:10,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:23,467 WARN L227 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 40 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:00:27,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:41,822 WARN L227 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:00:43,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:00:55,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:01:03,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:01:15,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:34,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:36,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:38,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:42,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:44,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:47,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:02:49,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 21:03:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:03:08,873 INFO L93 Difference]: Finished difference Result 970 states and 1149 transitions. [2021-12-06 21:03:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-06 21:03:08,874 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 102 [2021-12-06 21:03:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:03:08,879 INFO L225 Difference]: With dead ends: 970 [2021-12-06 21:03:08,879 INFO L226 Difference]: Without dead ends: 854 [2021-12-06 21:03:08,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 260.8s TimeCoverageRelationStatistics Valid=2080, Invalid=4508, Unknown=54, NotChecked=0, Total=6642 [2021-12-06 21:03:08,882 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 1656 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 356 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:03:08,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 3773 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2178 Invalid, 18 Unknown, 0 Unchecked, 70.5s Time] [2021-12-06 21:03:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-12-06 21:03:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 273. [2021-12-06 21:03:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.165991902834008) internal successors, (288), 264 states have internal predecessors, (288), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 21:03:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 296 transitions. [2021-12-06 21:03:08,914 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 296 transitions. Word has length 102 [2021-12-06 21:03:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:03:08,915 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 296 transitions. [2021-12-06 21:03:08,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 21:03:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 296 transitions. [2021-12-06 21:03:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-12-06 21:03:08,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:03:08,917 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:03:08,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-06 21:03:09,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:03:09,118 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-12-06 21:03:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:03:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2015125126, now seen corresponding path program 4 times [2021-12-06 21:03:09,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:03:09,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540390554] [2021-12-06 21:03:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:03:09,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:03:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:03:09,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 21:03:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:03:09,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 21:03:09,190 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 21:03:09,191 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2021-12-06 21:03:09,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2021-12-06 21:03:09,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2021-12-06 21:03:09,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2021-12-06 21:03:09,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2021-12-06 21:03:09,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2021-12-06 21:03:09,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2021-12-06 21:03:09,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2021-12-06 21:03:09,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 21:03:09,197 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:03:09,199 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 21:03:09,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 09:03:09 BoogieIcfgContainer [2021-12-06 21:03:09,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 21:03:09,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 21:03:09,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 21:03:09,252 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 21:03:09,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:57:06" (3/4) ... [2021-12-06 21:03:09,255 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 21:03:09,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 21:03:09,255 INFO L158 Benchmark]: Toolchain (without parser) took 363078.39ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 69.2MB in the beginning and 65.2MB in the end (delta: 4.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,255 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:03:09,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.54ms. Allocated memory is still 104.9MB. Free memory was 69.0MB in the beginning and 77.7MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,256 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,256 INFO L158 Benchmark]: RCFGBuilder took 343.53ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 59.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,257 INFO L158 Benchmark]: TraceAbstraction took 362426.65ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 58.8MB in the beginning and 65.2MB in the end (delta: -6.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-12-06 21:03:09,257 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 125.8MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:03:09,258 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.18ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.54ms. Allocated memory is still 104.9MB. Free memory was 69.0MB in the beginning and 77.7MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.53ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 59.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 362426.65ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 58.8MB in the beginning and 65.2MB in the end (delta: -6.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 125.8MB. Free memory is still 65.2MB. There was no memory consumed. 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 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 77, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24] [L77] EXPR (e + 128) << 24U [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=16777217, e=-24, res=16777217] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=16777217, __retres4=16777217, e=-24, res=16777217] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=16777217, ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 95 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 362.3s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 339.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 5311 SdHoareTripleChecker+Valid, 71.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5305 mSDsluCounter, 9173 SdHoareTripleChecker+Invalid, 70.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7724 mSDsCounter, 1347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4203 IncrementalHoareTripleChecker+Invalid, 5568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1347 mSolverCounterUnsat, 1449 mSDtfsCounter, 4203 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 817 SyntacticMatches, 2 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4664 ImplicationChecksByTransitivity, 281.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=15, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3039 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1404 ConstructedInterpolants, 0 QuantifiedInterpolants, 7977 SizeOfPredicates, 6 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 266/3608 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-06 21:03:09,469 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-12-06 21:03:09,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5c95aef-bcfb-4e11-aac1-9fc0cfdbab71/bin/uautomizer-DrprNOufMa/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample