./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:45:25,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:45:25,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:45:25,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:45:25,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:45:25,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:45:25,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:45:25,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:45:25,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:45:25,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:45:25,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:45:25,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:45:25,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:45:25,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:45:25,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:45:25,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:45:25,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:45:25,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:45:25,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:45:25,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:45:25,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:45:25,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:45:25,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:45:25,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:45:25,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:45:25,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:45:25,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:45:25,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:45:25,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:45:25,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:45:25,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:45:25,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:45:25,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:45:25,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:45:25,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:45:25,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:45:25,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:45:25,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:45:25,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:45:25,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:45:25,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:45:25,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 21:45:25,846 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:45:25,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:45:25,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:45:25,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:45:25,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:45:25,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:45:25,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:45:25,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:45:25,848 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:45:25,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 21:45:25,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:45:25,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 21:45:25,850 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:45:25,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 21:45:25,850 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:45:25,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 21:45:25,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:45:25,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:45:25,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:45:25,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:45:25,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:45:25,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 21:45:25,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 21:45:25,853 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:45:25,853 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-12-06 21:45:26,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:45:26,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:45:26,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:45:26,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:45:26,062 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:45:26,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-12-06 21:45:26,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/4a5056a15/e4650bce0e3344f7b153a23a92260a4c/FLAGd992a214c [2021-12-06 21:45:26,510 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:45:26,511 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c [2021-12-06 21:45:26,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/4a5056a15/e4650bce0e3344f7b153a23a92260a4c/FLAGd992a214c [2021-12-06 21:45:26,525 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/4a5056a15/e4650bce0e3344f7b153a23a92260a4c [2021-12-06 21:45:26,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:45:26,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:45:26,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:45:26,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:45:26,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:45:26,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf4a504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26, skipping insertion in model container [2021-12-06 21:45:26,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:45:26,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:45:26,656 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-12-06 21:45:26,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:45:26,678 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:45:26,688 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-12-06 21:45:26,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:45:26,706 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:45:26,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26 WrapperNode [2021-12-06 21:45:26,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:45:26,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:45:26,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:45:26,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:45:26,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,744 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2021-12-06 21:45:26,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:45:26,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:45:26,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:45:26,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:45:26,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:45:26,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:45:26,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:45:26,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:45:26,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (1/1) ... [2021-12-06 21:45:26,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:45:26,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:45:26,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:45:26,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:45:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-06 21:45:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:45:26,895 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:45:26,896 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:45:26,978 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:45:26,983 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:45:26,983 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 21:45:26,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:45:26 BoogieIcfgContainer [2021-12-06 21:45:26,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:45:26,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:45:26,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:45:26,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:45:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:45:26" (1/3) ... [2021-12-06 21:45:26,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d23e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:45:26, skipping insertion in model container [2021-12-06 21:45:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:26" (2/3) ... [2021-12-06 21:45:26,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d23e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:45:26, skipping insertion in model container [2021-12-06 21:45:26,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:45:26" (3/3) ... [2021-12-06 21:45:26,992 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-12-06 21:45:26,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:45:26,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 21:45:27,034 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:45:27,040 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 21:45:27,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 21:45:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 21:45:27,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:27,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:27,057 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-12-06 21:45:27,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:45:27,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586485365] [2021-12-06 21:45:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:27,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:45:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:45:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:45:27,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:45:27,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586485365] [2021-12-06 21:45:27,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586485365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:45:27,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:45:27,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:45:27,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422907237] [2021-12-06 21:45:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:45:27,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 21:45:27,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:45:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 21:45:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 21:45:27,220 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:45:27,232 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-12-06 21:45:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 21:45:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 21:45:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:45:27,239 INFO L225 Difference]: With dead ends: 29 [2021-12-06 21:45:27,240 INFO L226 Difference]: Without dead ends: 13 [2021-12-06 21:45:27,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 21:45:27,245 INFO L933 BasicCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:45:27,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:45:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-06 21:45:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-06 21:45:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-06 21:45:27,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-12-06 21:45:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:45:27,271 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-06 21:45:27,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-06 21:45:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 21:45:27,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:27,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:27,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:45:27,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:27,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-12-06 21:45:27,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:45:27,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772581236] [2021-12-06 21:45:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:27,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:45:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:45:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:45:27,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:45:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772581236] [2021-12-06 21:45:27,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772581236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:45:27,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:45:27,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:45:27,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146505963] [2021-12-06 21:45:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:45:27,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:45:27,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:45:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:45:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:45:27,336 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:45:27,348 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-12-06 21:45:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:45:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 21:45:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:45:27,349 INFO L225 Difference]: With dead ends: 24 [2021-12-06 21:45:27,350 INFO L226 Difference]: Without dead ends: 20 [2021-12-06 21:45:27,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:45:27,351 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:45:27,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:45:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-06 21:45:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-12-06 21:45:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-06 21:45:27,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-12-06 21:45:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:45:27,355 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-06 21:45:27,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-06 21:45:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 21:45:27,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:27,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:27,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:45:27,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-12-06 21:45:27,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:45:27,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345034999] [2021-12-06 21:45:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:27,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:45:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:45:27,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 21:45:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:45:27,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 21:45:27,406 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 21:45:27,407 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 21:45:27,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:45:27,411 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-06 21:45:27,413 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 21:45:27,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 09:45:27 BoogieIcfgContainer [2021-12-06 21:45:27,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 21:45:27,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 21:45:27,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 21:45:27,432 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 21:45:27,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:45:26" (3/4) ... [2021-12-06 21:45:27,434 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 21:45:27,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 21:45:27,435 INFO L158 Benchmark]: Toolchain (without parser) took 907.28ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 46.5MB in the end (delta: 30.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2021-12-06 21:45:27,435 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:45:27,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.64ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 90.5MB in the end (delta: -14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 21:45:27,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 88.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:45:27,437 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:45:27,437 INFO L158 Benchmark]: RCFGBuilder took 213.84ms. Allocated memory is still 117.4MB. Free memory was 87.4MB in the beginning and 77.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 21:45:27,437 INFO L158 Benchmark]: TraceAbstraction took 445.08ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 46.5MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-12-06 21:45:27,438 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 117.4MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:45:27,439 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.13ms. Allocated memory is still 117.4MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.64ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 90.5MB in the end (delta: -14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 88.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 213.84ms. Allocated memory is still 117.4MB. Free memory was 87.4MB in the beginning and 77.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 445.08ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 46.5MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 117.4MB. Free memory is still 46.5MB. 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: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}, max[sizeof(max) / sizeof(max[0]) - 1]=51, min={5:0}, min[0]=50] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={4:0}, min={5:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] VAL [i=0, max={4:0}, max[i]=49, min={5:0}] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-06 21:45:27,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/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 Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:45:29,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:45:29,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:45:29,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:45:29,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:45:29,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:45:29,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:45:29,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:45:29,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:45:29,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:45:29,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:45:29,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:45:29,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:45:29,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:45:29,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:45:29,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:45:29,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:45:29,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:45:29,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:45:29,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:45:29,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:45:29,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:45:29,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:45:29,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:45:29,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:45:29,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:45:29,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:45:29,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:45:29,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:45:29,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:45:29,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:45:29,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:45:29,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:45:29,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:45:29,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:45:29,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:45:29,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:45:29,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:45:29,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:45:29,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:45:29,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:45:29,098 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-06 21:45:29,117 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:45:29,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:45:29,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:45:29,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:45:29,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:45:29,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:45:29,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:45:29,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:45:29,120 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:45:29,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:45:29,120 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:45:29,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:45:29,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:45:29,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 21:45:29,121 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:45:29,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 21:45:29,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:45:29,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:45:29,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:45:29,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:45:29,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 21:45:29,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 21:45:29,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:45:29,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 21:45:29,124 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-12-06 21:45:29,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:45:29,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:45:29,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:45:29,383 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:45:29,383 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:45:29,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-12-06 21:45:29,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/0d111f8e8/5b5c9bc9ac2e4623950dfde5b43fdbf6/FLAGdb354acba [2021-12-06 21:45:29,813 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:45:29,813 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c [2021-12-06 21:45:29,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/0d111f8e8/5b5c9bc9ac2e4623950dfde5b43fdbf6/FLAGdb354acba [2021-12-06 21:45:29,827 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/data/0d111f8e8/5b5c9bc9ac2e4623950dfde5b43fdbf6 [2021-12-06 21:45:29,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:45:29,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:45:29,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:45:29,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:45:29,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:45:29,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:45:29" (1/1) ... [2021-12-06 21:45:29,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfbb3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:29, skipping insertion in model container [2021-12-06 21:45:29,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:45:29" (1/1) ... [2021-12-06 21:45:29,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:45:29,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:45:29,944 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-12-06 21:45:29,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:45:29,969 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:45:29,986 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_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-12-06 21:45:30,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:45:30,017 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:45:30,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30 WrapperNode [2021-12-06 21:45:30,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:45:30,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:45:30,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:45:30,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:45:30,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,048 INFO L137 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2021-12-06 21:45:30,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:45:30,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:45:30,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:45:30,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:45:30,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:45:30,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:45:30,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:45:30,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:45:30,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (1/1) ... [2021-12-06 21:45:30,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:45:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:45:30,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:45:30,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:45:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:45:30,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:45:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:45:30,189 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:45:30,190 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:45:31,475 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:45:31,481 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:45:31,481 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 21:45:31,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:45:31 BoogieIcfgContainer [2021-12-06 21:45:31,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:45:31,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:45:31,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:45:31,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:45:31,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:45:29" (1/3) ... [2021-12-06 21:45:31,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc70913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:45:31, skipping insertion in model container [2021-12-06 21:45:31,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:45:30" (2/3) ... [2021-12-06 21:45:31,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc70913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:45:31, skipping insertion in model container [2021-12-06 21:45:31,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:45:31" (3/3) ... [2021-12-06 21:45:31,489 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-12-06 21:45:31,494 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:45:31,494 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 21:45:31,531 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:45:31,538 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 21:45:31,538 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 21:45:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 21:45:31,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:31,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:31,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-12-06 21:45:31,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:45:31,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627066547] [2021-12-06 21:45:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:31,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:45:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:45:31,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:45:31,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 21:45:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:45:31,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-06 21:45:31,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:45:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:45:31,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:45:31,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:45:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627066547] [2021-12-06 21:45:31,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627066547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:45:31,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:45:31,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:45:31,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247379687] [2021-12-06 21:45:31,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:45:31,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 21:45:31,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:45:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 21:45:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 21:45:31,923 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:45:31,933 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-12-06 21:45:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 21:45:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 21:45:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:45:31,940 INFO L225 Difference]: With dead ends: 29 [2021-12-06 21:45:31,940 INFO L226 Difference]: Without dead ends: 13 [2021-12-06 21:45:31,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 21:45:31,945 INFO L933 BasicCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:45:31,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:45:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-06 21:45:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-06 21:45:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-06 21:45:31,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-12-06 21:45:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:45:31,968 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-06 21:45:31,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-06 21:45:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 21:45:31,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:31,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:31,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:45:32,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:45:32,171 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-12-06 21:45:32,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:45:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466612601] [2021-12-06 21:45:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:32,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:45:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:45:32,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:45:32,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 21:45:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:45:32,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 21:45:32,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:45:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:45:32,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:45:32,546 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:45:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466612601] [2021-12-06 21:45:32,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466612601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:45:32,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:45:32,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:45:32,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327383774] [2021-12-06 21:45:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:45:32,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:45:32,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:45:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:45:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:45:32,550 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:34,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:45:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:45:34,710 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-06 21:45:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:45:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 21:45:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:45:34,712 INFO L225 Difference]: With dead ends: 21 [2021-12-06 21:45:34,712 INFO L226 Difference]: Without dead ends: 17 [2021-12-06 21:45:34,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:45:34,715 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:45:34,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-06 21:45:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-06 21:45:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2021-12-06 21:45:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-06 21:45:34,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-12-06 21:45:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:45:34,721 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-06 21:45:34,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:45:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-06 21:45:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 21:45:34,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:45:34,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:45:34,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-06 21:45:34,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:45:34,923 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:45:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:45:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-12-06 21:45:34,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:45:34,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587084986] [2021-12-06 21:45:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:45:34,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:45:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:45:34,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:45:34,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 21:45:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:45:35,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-06 21:45:35,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:45:37,125 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:45:37,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 192 [2021-12-06 21:48:27,634 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from false [2021-12-06 21:48:29,652 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2021-12-06 21:48:37,502 WARN L227 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 21:48:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:48:37,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:48:37,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:48:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587084986] [2021-12-06 21:48:37,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587084986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:48:37,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:48:37,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:48:37,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739357606] [2021-12-06 21:48:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:48:37,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:48:37,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:48:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:48:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=61, Unknown=2, NotChecked=16, Total=110 [2021-12-06 21:48:37,516 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:40,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:48:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:48:41,156 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-06 21:48:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 21:48:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 21:48:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:48:41,158 INFO L225 Difference]: With dead ends: 28 [2021-12-06 21:48:41,158 INFO L226 Difference]: Without dead ends: 24 [2021-12-06 21:48:41,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=75, Invalid=167, Unknown=2, NotChecked=28, Total=272 [2021-12-06 21:48:41,160 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:48:41,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 20 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 1 Unknown, 17 Unchecked, 2.5s Time] [2021-12-06 21:48:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-06 21:48:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2021-12-06 21:48:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-12-06 21:48:41,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2021-12-06 21:48:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:48:41,164 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-06 21:48:41,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2021-12-06 21:48:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 21:48:41,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:48:41,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:48:41,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 21:48:41,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:48:41,367 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:48:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:48:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-12-06 21:48:41,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:48:41,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459882711] [2021-12-06 21:48:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:48:41,371 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:48:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:48:41,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:48:41,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 21:48:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:48:41,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:48:41,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:48:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:48:41,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:48:41,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:48:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459882711] [2021-12-06 21:48:41,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459882711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:48:41,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:48:41,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 21:48:41,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301068495] [2021-12-06 21:48:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:48:41,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:48:41,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:48:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:48:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:48:41,667 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:48:41,703 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-06 21:48:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:48:41,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 21:48:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:48:41,704 INFO L225 Difference]: With dead ends: 26 [2021-12-06 21:48:41,704 INFO L226 Difference]: Without dead ends: 15 [2021-12-06 21:48:41,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:48:41,705 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:48:41,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:48:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-06 21:48:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-06 21:48:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-06 21:48:41,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-12-06 21:48:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:48:41,709 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-06 21:48:41,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-12-06 21:48:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 21:48:41,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:48:41,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:48:41,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 21:48:41,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:48:41,912 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:48:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:48:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 854582592, now seen corresponding path program 1 times [2021-12-06 21:48:41,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:48:41,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131171088] [2021-12-06 21:48:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:48:41,916 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:48:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:48:41,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:48:41,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 21:48:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:48:42,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 21:48:42,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:48:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:48:42,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:48:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:48:42,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:48:42,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131171088] [2021-12-06 21:48:42,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131171088] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:48:42,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:48:42,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-06 21:48:42,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944131029] [2021-12-06 21:48:42,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:48:42,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:48:42,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:48:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:48:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:48:42,310 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:44,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:48:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:48:44,539 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-06 21:48:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:48:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 21:48:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:48:44,541 INFO L225 Difference]: With dead ends: 30 [2021-12-06 21:48:44,541 INFO L226 Difference]: Without dead ends: 26 [2021-12-06 21:48:44,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:48:44,542 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:48:44,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-06 21:48:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-06 21:48:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2021-12-06 21:48:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-12-06 21:48:44,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2021-12-06 21:48:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:48:44,548 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-12-06 21:48:44,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:48:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-12-06 21:48:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 21:48:44,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:48:44,549 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:48:44,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 21:48:44,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:48:44,750 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:48:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:48:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-12-06 21:48:44,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:48:44,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441431164] [2021-12-06 21:48:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:48:44,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:48:44,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:48:44,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:48:44,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 21:48:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:48:45,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 21:48:45,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:48:48,077 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-06 21:48:48,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 215 [2021-12-06 21:49:47,641 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0)) (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse1 .cse3) (fp.geq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3)) (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse2)))) is different from false [2021-12-06 21:49:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:47,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:49:57,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-12-06 21:49:59,228 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-12-06 21:50:11,471 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from false [2021-12-06 21:50:13,518 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from true [2021-12-06 21:50:26,772 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-12-06 21:50:28,818 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-12-06 21:50:39,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-12-06 21:50:41,828 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-12-06 21:51:02,375 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)))) is different from true [2021-12-06 21:52:21,736 WARN L227 SmtUtils]: Spent 22.19s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:52:39,443 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2021-12-06 21:53:00,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from false [2021-12-06 21:53:18,588 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2021-12-06 21:54:16,267 WARN L227 SmtUtils]: Spent 20.07s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:54:21,167 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-06 21:54:21,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 343 treesize of output 1 [2021-12-06 21:54:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 21:54:21,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:21,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441431164] [2021-12-06 21:54:21,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441431164] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:21,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:21,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-12-06 21:54:21,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54306392] [2021-12-06 21:54:21,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:21,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 21:54:21,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:21,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 21:54:21,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=160, Unknown=35, NotChecked=324, Total=600 [2021-12-06 21:54:21,174 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:54:23,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:24,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:26,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:28,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:30,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:32,823 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse4 (let ((.cse15 (select .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse3 (let ((.cse14 (select .cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse6 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse0 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse2 (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse4 .cse1) (let ((.cse5 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and (not .cse5) .cse6) (and .cse5 |c_ULTIMATE.start_main_#t~short7#1|))) (or (let ((.cse8 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)))) (and (fp.leq .cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse8 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3)) .cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 21:54:35,090 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse7 (let ((.cse15 (select .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse6 (let ((.cse14 (select .cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse0 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse5 (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse4 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 .cse1) (let ((.cse2 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4))) (or (and .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse3 (not .cse2)))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse7 .cse1) (or .cse3 (let ((.cse8 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse7) (fp.sub c_currentRoundingMode .cse6 .cse7)))) (and (fp.leq .cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse8 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 21:55:00,185 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:55:02,719 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse7 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32))) (.cse3 (let ((.cse16 (select .cse9 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse5 (let ((.cse15 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (let ((.cse4 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse7)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= (let ((.cse8 (select .cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) .cse2) (let ((.cse12 (let ((.cse14 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse7)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (or (let ((.cse10 (let ((.cse11 (let ((.cse13 (select .cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse7)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11))))) (and (fp.geq .cse10 (_ +zero 8 24)) (fp.leq .cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse12)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 21:55:05,161 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse4 (let ((.cse15 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse11 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (let ((.cse3 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= (let ((.cse5 (select .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse2) (let ((.cse9 (let ((.cse12 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse11)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (let ((.cse7 (let ((.cse8 (let ((.cse10 (select .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse11)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse8) (fp.sub c_currentRoundingMode .cse9 .cse8))))) (and (fp.geq .cse7 (_ +zero 8 24)) (fp.leq .cse7 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse9)))) (= (let ((.cse13 (select .cse6 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse14 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse11)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 21:55:38,950 WARN L227 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 89 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:55:40,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:55:53,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse14 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (let ((.cse10 (let ((.cse11 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse2 .cse10))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.geq .cse3 (_ +zero 8 24)) (= (let ((.cse4 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= (let ((.cse6 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) .cse1) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse9 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2021-12-06 21:55:56,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:12,816 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 41 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 21:56:14,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:16,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:18,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:20,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:21,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:56:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:56:21,812 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-12-06 21:56:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 21:56:21,813 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-06 21:56:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:56:21,814 INFO L225 Difference]: With dead ends: 27 [2021-12-06 21:56:21,814 INFO L226 Difference]: Without dead ends: 23 [2021-12-06 21:56:21,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 236.0s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=56, NotChecked=658, Total=1056 [2021-12-06 21:56:21,816 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2021-12-06 21:56:21,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 9 Unknown, 116 Unchecked, 22.8s Time] [2021-12-06 21:56:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-06 21:56:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-06 21:56:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:56:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-12-06 21:56:21,820 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2021-12-06 21:56:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:56:21,820 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-12-06 21:56:21,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:56:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2021-12-06 21:56:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 21:56:21,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:56:21,821 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:56:21,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 21:56:22,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:56:22,023 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:56:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:56:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1200727353, now seen corresponding path program 2 times [2021-12-06 21:56:22,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:56:22,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585908995] [2021-12-06 21:56:22,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:56:22,027 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:56:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:56:22,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:56:22,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d1311c0-d4bf-4a85-9e8b-040bdcf23661/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 21:56:22,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:56:22,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:56:22,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-06 21:56:22,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:56:28,927 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-06 21:56:28,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 462 treesize of output 226 [2021-12-06 21:59:31,618 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse3) (let ((.cse4 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse4)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse4))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))) is different from true [2021-12-06 22:00:32,531 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))) is different from false [2021-12-06 22:00:34,554 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))) is different from true [2021-12-06 22:00:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:00:34,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:00:45,021 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false