./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc --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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:42:50,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:42:50,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:42:50,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:42:50,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:42:50,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:42:50,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:42:50,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:42:50,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:42:50,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:42:50,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:42:50,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:42:50,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:42:50,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:42:50,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:42:50,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:42:50,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:42:50,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:42:50,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:42:50,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:42:50,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:42:50,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:42:50,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:42:50,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:42:50,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:42:50,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:42:50,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:42:50,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:42:50,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:42:50,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:42:50,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:42:50,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:42:50,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:42:50,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:42:50,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:42:50,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:42:50,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:42:50,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:42:50,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:42:50,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:42:50,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:42:50,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:42:50,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:42:50,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:42:50,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:42:50,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:42:50,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:42:50,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:42:50,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:42:50,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:42:50,164 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:42:50,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:42:50,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:42:50,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:42:50,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:42:50,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:42:50,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:42:50,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:42:50,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:42:50,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:42:50,167 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:42:50,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:42:50,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:42:50,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:42:50,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:42:50,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:42:50,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:42:50,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:42:50,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:50,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:42:50,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:42:50,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:42:50,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:42:50,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:42:50,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:42:50,170 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_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/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_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2022-11-02 20:42:50,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:42:50,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:42:50,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:42:50,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:42:50,496 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:42:50,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-11-02 20:42:50,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/data/f4495be27/c5d796f2fcf240ae99f54ca1c76b7416/FLAG6344adc6d [2022-11-02 20:42:51,051 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:42:51,051 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-11-02 20:42:51,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/data/f4495be27/c5d796f2fcf240ae99f54ca1c76b7416/FLAG6344adc6d [2022-11-02 20:42:51,417 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/data/f4495be27/c5d796f2fcf240ae99f54ca1c76b7416 [2022-11-02 20:42:51,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:42:51,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:42:51,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:51,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:42:51,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:42:51,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c69ab8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51, skipping insertion in model container [2022-11-02 20:42:51,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:42:51,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:42:51,664 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_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-11-02 20:42:51,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:51,715 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:42:51,727 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_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-11-02 20:42:51,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:51,792 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:42:51,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51 WrapperNode [2022-11-02 20:42:51,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:51,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:51,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:42:51,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:42:51,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,828 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-11-02 20:42:51,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:51,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:42:51,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:42:51,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:42:51,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,854 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:42:51,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:42:51,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:42:51,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:42:51,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (1/1) ... [2022-11-02 20:42:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:51,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:51,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:42:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:42:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:42:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-11-02 20:42:51,969 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-11-02 20:42:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:42:51,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:42:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-11-02 20:42:51,971 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-11-02 20:42:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:42:51,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:42:52,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:42:52,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:42:52,483 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:42:52,490 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:42:52,490 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:42:52,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:52 BoogieIcfgContainer [2022-11-02 20:42:52,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:42:52,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:42:52,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:42:52,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:42:52,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:42:51" (1/3) ... [2022-11-02 20:42:52,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1544ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:52, skipping insertion in model container [2022-11-02 20:42:52,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:51" (2/3) ... [2022-11-02 20:42:52,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1544ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:52, skipping insertion in model container [2022-11-02 20:42:52,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:52" (3/3) ... [2022-11-02 20:42:52,523 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2022-11-02 20:42:52,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:42:52,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-02 20:42:52,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:42:52,641 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4738a898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:42:52,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-02 20:42:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:42:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:42:52,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:52,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:52,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 915940719, now seen corresponding path program 1 times [2022-11-02 20:42:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:52,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256820605] [2022-11-02 20:42:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:52,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256820605] [2022-11-02 20:42:52,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256820605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:52,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:52,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258000152] [2022-11-02 20:42:52,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:52,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:42:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:42:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:42:52,955 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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) [2022-11-02 20:42:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:53,008 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2022-11-02 20:42:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:42:53,011 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 [2022-11-02 20:42:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:53,030 INFO L225 Difference]: With dead ends: 163 [2022-11-02 20:42:53,030 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:42:53,036 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:42:53,041 INFO L413 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:53,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:42:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 20:42:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 62 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-11-02 20:42:53,092 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 9 [2022-11-02 20:42:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:53,093 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-11-02 20:42:53,094 INFO L496 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) [2022-11-02 20:42:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-11-02 20:42:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:42:53,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:53,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:53,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:42:53,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash 914999453, now seen corresponding path program 1 times [2022-11-02 20:42:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:53,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091520296] [2022-11-02 20:42:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:53,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091520296] [2022-11-02 20:42:53,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091520296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:53,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:53,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:42:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226904425] [2022-11-02 20:42:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:53,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:53,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:53,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:53,245 INFO L87 Difference]: Start difference. First operand 72 states and 86 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) [2022-11-02 20:42:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:53,383 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2022-11-02 20:42:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:42:53,384 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 [2022-11-02 20:42:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:53,394 INFO L225 Difference]: With dead ends: 181 [2022-11-02 20:42:53,394 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:42:53,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:53,396 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:53,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 227 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:42:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2022-11-02 20:42:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 92 states have internal predecessors, (116), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-11-02 20:42:53,422 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 9 [2022-11-02 20:42:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:53,422 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-11-02 20:42:53,423 INFO L496 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) [2022-11-02 20:42:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-11-02 20:42:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:42:53,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:53,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:53,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:42:53,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -718991324, now seen corresponding path program 1 times [2022-11-02 20:42:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548600557] [2022-11-02 20:42:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:53,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548600557] [2022-11-02 20:42:53,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548600557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:53,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:53,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879503792] [2022-11-02 20:42:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:53,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:53,628 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-11-02 20:42:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:53,746 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2022-11-02 20:42:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-11-02 20:42:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:53,748 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:42:53,748 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:42:53,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:53,750 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:53,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 306 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:42:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-02 20:42:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.4625) internal successors, (117), 94 states have internal predecessors, (117), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2022-11-02 20:42:53,763 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 13 [2022-11-02 20:42:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:53,764 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2022-11-02 20:42:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-11-02 20:42:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2022-11-02 20:42:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:42:53,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:53,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:53,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:42:53,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -813894463, now seen corresponding path program 1 times [2022-11-02 20:42:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654249225] [2022-11-02 20:42:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:53,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654249225] [2022-11-02 20:42:53,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654249225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:53,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:53,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759349044] [2022-11-02 20:42:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:53,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:53,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:53,890 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-02 20:42:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:53,984 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2022-11-02 20:42:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-02 20:42:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:53,986 INFO L225 Difference]: With dead ends: 198 [2022-11-02 20:42:53,986 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:42:53,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:53,988 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 94 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:53,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 246 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:42:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2022-11-02 20:42:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 98 states have internal predecessors, (121), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2022-11-02 20:42:54,001 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 14 [2022-11-02 20:42:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:54,001 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2022-11-02 20:42:54,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-02 20:42:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2022-11-02 20:42:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:42:54,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:54,003 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:54,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:42:54,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -459560941, now seen corresponding path program 1 times [2022-11-02 20:42:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:54,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025107334] [2022-11-02 20:42:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:54,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025107334] [2022-11-02 20:42:54,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025107334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:54,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:54,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895763901] [2022-11-02 20:42:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:54,077 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-02 20:42:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:54,169 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2022-11-02 20:42:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2022-11-02 20:42:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:54,171 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:42:54,171 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:42:54,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:42:54,173 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 63 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:54,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 279 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:42:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-02 20:42:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.438095238095238) internal successors, (151), 118 states have internal predecessors, (151), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2022-11-02 20:42:54,187 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 16 [2022-11-02 20:42:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:54,188 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2022-11-02 20:42:54,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-02 20:42:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2022-11-02 20:42:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:42:54,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:54,189 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:54,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:42:54,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1079576499, now seen corresponding path program 1 times [2022-11-02 20:42:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:54,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82755505] [2022-11-02 20:42:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:54,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82755505] [2022-11-02 20:42:54,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82755505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216985858] [2022-11-02 20:42:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:42:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:42:54,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:54,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:54,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216985858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:54,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:42:54,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-02 20:42:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696479000] [2022-11-02 20:42:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:54,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:54,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:54,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:54,433 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-11-02 20:42:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:54,474 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-11-02 20:42:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:42:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2022-11-02 20:42:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:54,476 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:42:54,476 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:42:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:54,478 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:54,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 245 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:42:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2022-11-02 20:42:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 116 states have internal predecessors, (147), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-11-02 20:42:54,491 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 15 [2022-11-02 20:42:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:54,491 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-11-02 20:42:54,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-11-02 20:42:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-11-02 20:42:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:42:54,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:54,493 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:54,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:54,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1361487226, now seen corresponding path program 1 times [2022-11-02 20:42:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:54,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566785066] [2022-11-02 20:42:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:42:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566785066] [2022-11-02 20:42:54,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566785066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:54,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:54,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921005786] [2022-11-02 20:42:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:54,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:54,774 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:54,798 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-11-02 20:42:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:54,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2022-11-02 20:42:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:54,800 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:42:54,800 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:42:54,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:54,802 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:54,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:42:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-11-02 20:42:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 113 states have internal predecessors, (142), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-11-02 20:42:54,815 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 17 [2022-11-02 20:42:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:54,815 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-11-02 20:42:54,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:42:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-11-02 20:42:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:42:54,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:54,817 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:42:54,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1631017083, now seen corresponding path program 1 times [2022-11-02 20:42:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:54,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737938876] [2022-11-02 20:42:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:54,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737938876] [2022-11-02 20:42:54,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737938876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:54,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:54,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977994294] [2022-11-02 20:42:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:54,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:54,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:54,872 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-02 20:42:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:54,941 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2022-11-02 20:42:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2022-11-02 20:42:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:54,943 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:42:54,943 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:42:54,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:42:54,944 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:54,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 278 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:42:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2022-11-02 20:42:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 116 states have internal predecessors, (144), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2022-11-02 20:42:54,964 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 18 [2022-11-02 20:42:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:54,964 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2022-11-02 20:42:54,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-02 20:42:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2022-11-02 20:42:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:42:54,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:54,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:42:54,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -424506547, now seen corresponding path program 1 times [2022-11-02 20:42:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:54,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348149512] [2022-11-02 20:42:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:42:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:55,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348149512] [2022-11-02 20:42:55,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348149512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:55,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:55,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:42:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534387475] [2022-11-02 20:42:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:55,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:55,039 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-02 20:42:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:55,085 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2022-11-02 20:42:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:42:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2022-11-02 20:42:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:55,089 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:42:55,089 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:42:55,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:55,093 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:55,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 234 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:42:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2022-11-02 20:42:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.386138613861386) internal successors, (140), 113 states have internal predecessors, (140), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2022-11-02 20:42:55,119 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 19 [2022-11-02 20:42:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:55,121 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2022-11-02 20:42:55,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-02 20:42:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2022-11-02 20:42:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:42:55,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:55,125 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:42:55,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -614250977, now seen corresponding path program 1 times [2022-11-02 20:42:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732142398] [2022-11-02 20:42:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:42:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732142398] [2022-11-02 20:42:55,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732142398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:55,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:55,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191660199] [2022-11-02 20:42:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:55,217 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-11-02 20:42:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:55,292 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2022-11-02 20:42:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2022-11-02 20:42:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:55,294 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:42:55,295 INFO L226 Difference]: Without dead ends: 137 [2022-11-02 20:42:55,295 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:42:55,296 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:55,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 275 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-02 20:42:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-11-02 20:42:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 107 states have internal predecessors, (132), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2022-11-02 20:42:55,310 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 23 [2022-11-02 20:42:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:55,312 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2022-11-02 20:42:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-11-02 20:42:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-11-02 20:42:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:42:55,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:55,317 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:55,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:42:55,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash -997219449, now seen corresponding path program 1 times [2022-11-02 20:42:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:55,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225545916] [2022-11-02 20:42:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:42:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:55,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225545916] [2022-11-02 20:42:55,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225545916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:55,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:55,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876188865] [2022-11-02 20:42:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:55,414 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-02 20:42:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:55,485 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2022-11-02 20:42:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-11-02 20:42:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:55,487 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:42:55,487 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:42:55,488 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:42:55,488 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:55,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 275 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:42:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:42:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2022-11-02 20:42:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.351063829787234) internal successors, (127), 102 states have internal predecessors, (127), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-11-02 20:42:55,500 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 25 [2022-11-02 20:42:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:55,501 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-11-02 20:42:55,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-02 20:42:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-11-02 20:42:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:42:55,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:55,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:55,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:42:55,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1249154163, now seen corresponding path program 1 times [2022-11-02 20:42:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341759953] [2022-11-02 20:42:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:42:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341759953] [2022-11-02 20:42:55,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341759953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499141106] [2022-11-02 20:42:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:42:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:55,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:42:55,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:42:55,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:56,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499141106] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:56,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:42:56,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-11-02 20:42:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614374076] [2022-11-02 20:42:56,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:56,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:42:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:42:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:42:56,161 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:42:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:56,632 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-11-02 20:42:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:42:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-11-02 20:42:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:56,634 INFO L225 Difference]: With dead ends: 262 [2022-11-02 20:42:56,634 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:42:56,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:42:56,636 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:56,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 763 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:42:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:42:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2022-11-02 20:42:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 88 states have internal predecessors, (105), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:42:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-11-02 20:42:56,653 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 29 [2022-11-02 20:42:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:56,653 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-11-02 20:42:56,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:42:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-11-02 20:42:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:42:56,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:56,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:56,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:42:56,872 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1266015036, now seen corresponding path program 1 times [2022-11-02 20:42:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:56,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435959754] [2022-11-02 20:42:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:42:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:57,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435959754] [2022-11-02 20:42:57,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435959754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:42:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904408048] [2022-11-02 20:42:57,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:42:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:42:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:42:57,026 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:42:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:57,121 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-11-02 20:42:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:42:57,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-11-02 20:42:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:57,124 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:42:57,124 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:42:57,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:42:57,126 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:57,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 499 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:42:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-11-02 20:42:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 97 states have internal predecessors, (113), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-02 20:42:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-11-02 20:42:57,146 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 33 [2022-11-02 20:42:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:57,147 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-11-02 20:42:57,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:42:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-11-02 20:42:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:42:57,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:57,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:57,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:42:57,149 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 700268352, now seen corresponding path program 1 times [2022-11-02 20:42:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:57,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186462804] [2022-11-02 20:42:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:42:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:42:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:57,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186462804] [2022-11-02 20:42:57,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186462804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:42:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95114137] [2022-11-02 20:42:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:42:57,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:42:57,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:42:57,372 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:42:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:57,506 INFO L93 Difference]: Finished difference Result 184 states and 215 transitions. [2022-11-02 20:42:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:42:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-02 20:42:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:57,508 INFO L225 Difference]: With dead ends: 184 [2022-11-02 20:42:57,508 INFO L226 Difference]: Without dead ends: 144 [2022-11-02 20:42:57,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:42:57,509 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 71 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:57,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 602 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:42:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-02 20:42:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2022-11-02 20:42:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.308411214953271) internal successors, (140), 116 states have internal predecessors, (140), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-02 20:42:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2022-11-02 20:42:57,524 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 37 [2022-11-02 20:42:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:57,524 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2022-11-02 20:42:57,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:42:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2022-11-02 20:42:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:42:57,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:57,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:42:57,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1158132499, now seen corresponding path program 2 times [2022-11-02 20:42:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128272858] [2022-11-02 20:42:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:42:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:42:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128272858] [2022-11-02 20:42:57,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128272858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:42:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943940616] [2022-11-02 20:42:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:42:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:42:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:42:57,786 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:42:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:58,021 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2022-11-02 20:42:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:42:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-02 20:42:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:58,023 INFO L225 Difference]: With dead ends: 257 [2022-11-02 20:42:58,023 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 20:42:58,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:42:58,025 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:58,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1082 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:42:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 20:42:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2022-11-02 20:42:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 142 states have (on average 1.323943661971831) internal successors, (188), 152 states have internal predecessors, (188), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2022-11-02 20:42:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2022-11-02 20:42:58,046 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 37 [2022-11-02 20:42:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:58,047 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2022-11-02 20:42:58,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:42:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2022-11-02 20:42:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:42:58,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:58,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:42:58,049 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1158072917, now seen corresponding path program 1 times [2022-11-02 20:42:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417724271] [2022-11-02 20:42:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:42:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:42:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:58,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417724271] [2022-11-02 20:42:58,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417724271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361060156] [2022-11-02 20:42:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:58,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:58,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:42:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:42:58,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:42:58,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:42:58,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361060156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:58,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:42:58,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-02 20:42:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862051616] [2022-11-02 20:42:58,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:58,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:42:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:42:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:42:58,705 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:42:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:59,066 INFO L93 Difference]: Finished difference Result 337 states and 426 transitions. [2022-11-02 20:42:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:42:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-11-02 20:42:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:59,068 INFO L225 Difference]: With dead ends: 337 [2022-11-02 20:42:59,068 INFO L226 Difference]: Without dead ends: 277 [2022-11-02 20:42:59,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:42:59,070 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 189 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:59,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 811 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:42:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-02 20:42:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2022-11-02 20:42:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 200 states have internal predecessors, (255), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2022-11-02 20:42:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 309 transitions. [2022-11-02 20:42:59,097 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 309 transitions. Word has length 37 [2022-11-02 20:42:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:59,098 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 309 transitions. [2022-11-02 20:42:59,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:42:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 309 transitions. [2022-11-02 20:42:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:42:59,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:59,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:59,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:59,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:42:59,316 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:42:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1294716000, now seen corresponding path program 1 times [2022-11-02 20:42:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326510320] [2022-11-02 20:42:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:42:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:42:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326510320] [2022-11-02 20:42:59,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326510320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929918763] [2022-11-02 20:42:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:59,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:59,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:42:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:42:59,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:42:59,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:42:59,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929918763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:59,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:42:59,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2022-11-02 20:42:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304850899] [2022-11-02 20:42:59,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:59,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:42:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:42:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:42:59,841 INFO L87 Difference]: Start difference. First operand 236 states and 309 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:43:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:00,149 INFO L93 Difference]: Finished difference Result 350 states and 450 transitions. [2022-11-02 20:43:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:43:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-11-02 20:43:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:00,151 INFO L225 Difference]: With dead ends: 350 [2022-11-02 20:43:00,151 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 20:43:00,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:43:00,153 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:00,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 699 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 20:43:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 215. [2022-11-02 20:43:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 184 states have internal predecessors, (237), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2022-11-02 20:43:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2022-11-02 20:43:00,173 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 39 [2022-11-02 20:43:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:00,173 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2022-11-02 20:43:00,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:43:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2022-11-02 20:43:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:43:00,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:00,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:00,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:00,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:43:00,400 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:43:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash -838128895, now seen corresponding path program 1 times [2022-11-02 20:43:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:00,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451651117] [2022-11-02 20:43:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:43:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:43:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:43:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:43:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:00,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451651117] [2022-11-02 20:43:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451651117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:00,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:43:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432088935] [2022-11-02 20:43:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:43:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:43:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:00,762 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:43:01,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:04,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:04,158 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2022-11-02 20:43:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:43:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-02 20:43:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:04,161 INFO L225 Difference]: With dead ends: 248 [2022-11-02 20:43:04,161 INFO L226 Difference]: Without dead ends: 247 [2022-11-02 20:43:04,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:43:04,162 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 148 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:04,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 785 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:43:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-02 20:43:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2022-11-02 20:43:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 184 states have internal predecessors, (236), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2022-11-02 20:43:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2022-11-02 20:43:04,181 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 39 [2022-11-02 20:43:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:04,181 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2022-11-02 20:43:04,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:43:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2022-11-02 20:43:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:43:04,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:04,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:04,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:43:04,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:43:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1741690569, now seen corresponding path program 1 times [2022-11-02 20:43:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388312361] [2022-11-02 20:43:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:04,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:04,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:04,239 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:43:04,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-02 20:43:04,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-02 20:43:04,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-02 20:43:04,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-02 20:43:04,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-02 20:43:04,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-02 20:43:04,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-02 20:43:04,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-02 20:43:04,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-02 20:43:04,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-02 20:43:04,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-02 20:43:04,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-02 20:43:04,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-02 20:43:04,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-02 20:43:04,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-02 20:43:04,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-02 20:43:04,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:43:04,249 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:04,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:43:04,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:43:04 BoogieIcfgContainer [2022-11-02 20:43:04,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:43:04,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:43:04,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:43:04,284 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:43:04,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:52" (3/4) ... [2022-11-02 20:43:04,287 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:43:04,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:43:04,288 INFO L158 Benchmark]: Toolchain (without parser) took 12867.29ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 99.8MB in the beginning and 106.3MB in the end (delta: -6.5MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2022-11-02 20:43:04,288 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:43:04,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.49ms. Allocated memory is still 132.1MB. Free memory was 99.5MB in the beginning and 106.1MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:43:04,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 132.1MB. Free memory was 106.1MB in the beginning and 104.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:43:04,289 INFO L158 Benchmark]: Boogie Preprocessor took 28.46ms. Allocated memory is still 132.1MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:43:04,289 INFO L158 Benchmark]: RCFGBuilder took 643.56ms. Allocated memory is still 132.1MB. Free memory was 102.9MB in the beginning and 85.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:43:04,290 INFO L158 Benchmark]: TraceAbstraction took 11778.55ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 84.8MB in the beginning and 107.3MB in the end (delta: -22.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-11-02 20:43:04,290 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 106.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:43:04,291 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.29ms. Allocated memory is still 83.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.49ms. Allocated memory is still 132.1MB. Free memory was 99.5MB in the beginning and 106.1MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.17ms. Allocated memory is still 132.1MB. Free memory was 106.1MB in the beginning and 104.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.46ms. Allocated memory is still 132.1MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.56ms. Allocated memory is still 132.1MB. Free memory was 102.9MB in the beginning and 85.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11778.55ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 84.8MB in the beginning and 107.3MB in the end (delta: -22.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 106.3MB in the end (delta: 1.0MB). 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: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 77, overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 112. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=-125] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L242] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=-125] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L243] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=-125, ma=33554432, zero=0] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-125, \old(m)=16777216] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L30] COND FALSE !(! m) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L58] COND TRUE 1 VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=0] [L78] EXPR e + 128 [L78] res = m | ((unsigned int )(e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=-125, \old(m)=16777216, __retres4=1, e=-125, m=0, res=1] [L81] return (__retres4); VAL [\old(e)=-125, \old(m)=16777216, \result=36028797018963969, __retres4=1, e=-125, m=0, res=1] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=36028797018963969, ea=127, eb=-125, ma=33554432, mb=16777216, zero=0] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=1] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ma=0] [L110] EXPR (int )(a >> 24U) - 128 [L110] ea = (int )(a >> 24U) - 128 [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, mb=0] [L113] (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, mb=0] - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: 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 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1139 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1111 mSDsluCounter, 7863 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6350 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1649 IncrementalHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1513 mSDtfsCounter, 1649 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 396 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1754 SizeOfPredicates, 11 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 214/259 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 [2022-11-02 20:43:04,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe5e67-ef42-40ba-9c37-9380c1eafb82/bin/uautomizer-Dbtcem3rbc/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