./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/bary_diverge.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/bary_diverge.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:15:28,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:15:28,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:15:28,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:15:28,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:15:28,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:15:28,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:15:28,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:15:28,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:15:28,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:15:28,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:15:28,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:15:28,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:15:28,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:15:28,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:15:28,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:15:28,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:15:28,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:15:28,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:15:28,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:15:28,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:15:28,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:15:28,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:15:28,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:15:28,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:15:28,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:15:28,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:15:28,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:15:28,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:15:28,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:15:28,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:15:28,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:15:28,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:15:28,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:15:28,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:15:28,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:15:28,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:15:28,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:15:28,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:15:28,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:15:28,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:15:28,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 06:15:28,891 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:15:28,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:15:28,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:15:28,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:15:28,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:15:28,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:15:28,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:15:28,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:15:28,894 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:15:28,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:15:28,895 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:15:28,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 06:15:28,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:15:28,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:15:28,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:15:28,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:15:28,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:15:28,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:15:28,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:15:28,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:15:28,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:15:28,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:15:28,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:15:28,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 06:15:28,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 06:15:28,898 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:15:28,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:15:28,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:15:28,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:15:28,899 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2021-12-17 06:15:29,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:15:29,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:15:29,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:15:29,122 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:15:29,123 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:15:29,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2021-12-17 06:15:29,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd913286/cd6a1174ef054651bde1a9383af31e28/FLAG8e163e874 [2021-12-17 06:15:29,518 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:15:29,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2021-12-17 06:15:29,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd913286/cd6a1174ef054651bde1a9383af31e28/FLAG8e163e874 [2021-12-17 06:15:29,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd913286/cd6a1174ef054651bde1a9383af31e28 [2021-12-17 06:15:29,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:15:29,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:15:29,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:15:29,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:15:29,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:15:29,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:15:29" (1/1) ... [2021-12-17 06:15:29,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789938b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:29, skipping insertion in model container [2021-12-17 06:15:29,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:15:29" (1/1) ... [2021-12-17 06:15:29,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:15:29,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:15:30,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2021-12-17 06:15:30,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:15:30,142 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:15:30,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2021-12-17 06:15:30,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:15:30,173 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:15:30,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30 WrapperNode [2021-12-17 06:15:30,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:15:30,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:15:30,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:15:30,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:15:30,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,205 INFO L137 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2021-12-17 06:15:30,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:15:30,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:15:30,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:15:30,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:15:30,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:15:30,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:15:30,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:15:30,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:15:30,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (1/1) ... [2021-12-17 06:15:30,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:15:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:15:30,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:15:30,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:15:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:15:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2021-12-17 06:15:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2021-12-17 06:15:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 06:15:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:15:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:15:30,361 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:15:30,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:15:30,487 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:15:30,491 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:15:30,492 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 06:15:30,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:15:30 BoogieIcfgContainer [2021-12-17 06:15:30,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:15:30,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:15:30,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:15:30,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:15:30,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:15:29" (1/3) ... [2021-12-17 06:15:30,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2424a5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:15:30, skipping insertion in model container [2021-12-17 06:15:30,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:30" (2/3) ... [2021-12-17 06:15:30,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2424a5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:15:30, skipping insertion in model container [2021-12-17 06:15:30,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:15:30" (3/3) ... [2021-12-17 06:15:30,504 INFO L111 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2021-12-17 06:15:30,523 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:15:30,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:15:30,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:15:30,580 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-17 06:15:30,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:15:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 06:15:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:15:30,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:30,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:30,597 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2021-12-17 06:15:30,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:15:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904937440] [2021-12-17 06:15:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:30,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:15:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 06:15:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 06:15:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 06:15:30,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:15:30,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904937440] [2021-12-17 06:15:30,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904937440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:15:30,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:15:30,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 06:15:30,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296060861] [2021-12-17 06:15:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:15:30,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 06:15:30,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:15:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 06:15:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 06:15:30,803 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 06:15:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:15:30,818 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2021-12-17 06:15:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 06:15:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-12-17 06:15:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:15:30,825 INFO L225 Difference]: With dead ends: 61 [2021-12-17 06:15:30,826 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 06:15:30,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-17 06:15:30,835 INFO L933 BasicCegarLoop]: 38 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, 38 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-17 06:15:30,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:15:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 06:15:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-17 06:15:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 06:15:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-17 06:15:30,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2021-12-17 06:15:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:15:30,865 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-17 06:15:30,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 06:15:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-17 06:15:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:15:30,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:30,868 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:30,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 06:15:30,869 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2021-12-17 06:15:30,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:15:30,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91494134] [2021-12-17 06:15:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:30,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:15:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:15:30,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 06:15:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:15:30,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 06:15:30,955 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 06:15:30,956 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:15:30,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 06:15:30,962 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 06:15:30,963 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:15:30,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:15:30 BoogieIcfgContainer [2021-12-17 06:15:30,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:15:31,000 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:15:31,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:15:31,001 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:15:31,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:15:30" (3/4) ... [2021-12-17 06:15:31,004 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 06:15:31,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:15:31,005 INFO L158 Benchmark]: Toolchain (without parser) took 1086.54ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 107.7MB in the beginning and 116.8MB in the end (delta: -9.1MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,005 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:15:31,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.93ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 107.7MB in the beginning and 157.8MB in the end (delta: -50.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.67ms. Allocated memory is still 182.5MB. Free memory was 157.8MB in the beginning and 155.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,010 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 958.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,010 INFO L158 Benchmark]: RCFGBuilder took 252.79ms. Allocated memory is still 182.5MB. Free memory was 154.5MB in the beginning and 144.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,010 INFO L158 Benchmark]: TraceAbstraction took 505.55ms. Allocated memory is still 182.5MB. Free memory was 143.2MB in the beginning and 116.8MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-17 06:15:31,011 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 182.5MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:15:31,015 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.17ms. Allocated memory is still 130.0MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.93ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 107.7MB in the beginning and 157.8MB in the end (delta: -50.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.67ms. Allocated memory is still 182.5MB. Free memory was 157.8MB in the beginning and 155.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 958.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.79ms. Allocated memory is still 182.5MB. Free memory was 154.5MB in the beginning and 144.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 505.55ms. Allocated memory is still 182.5MB. Free memory was 143.2MB in the beginning and 116.8MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 182.5MB. Free memory is still 116.8MB. 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: 14]: 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 50. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; VAL [C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=0, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=50, C1=0, I=0, INIT=1, x=50, X=0, Y=0, Z=0] [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, RANDOM_INPUT()=50, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=50, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=50, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=49, C1=50, I=0, INIT=1, X=0, x=49, Y=0, Z=0] [L59] RET, EXPR RANDOM_INPUT() VAL [C1=50, I=0, INIT=1, RANDOM_INPUT()=49, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=50, i=0, I=49, INIT=1, X=0, Y=0, Z=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND TRUE C1 > 0.f [L37] Z = Y [L38] Y = X VAL [C1=50, I=49, INIT=1, X=0, Y=0, Z=0] [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I VAL [C1=50, I=49, INIT=1, X=49, Y=49, Z=49] [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [\old(cond)=0, C1=50, cond=0, I=49, INIT=1, X=49, Y=49, Z=49] [L14] reach_error() VAL [\old(cond)=0, C1=50, cond=0, I=49, INIT=1, X=49, Y=49, Z=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 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-17 06:15:31,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/bary_diverge.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:15:32,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:15:32,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:15:32,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:15:32,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:15:32,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:15:32,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:15:32,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:15:32,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:15:32,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:15:32,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:15:32,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:15:32,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:15:32,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:15:32,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:15:32,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:15:32,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:15:32,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:15:32,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:15:32,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:15:32,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:15:32,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:15:32,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:15:32,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:15:32,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:15:32,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:15:32,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:15:32,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:15:32,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:15:32,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:15:32,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:15:32,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:15:32,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:15:32,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:15:32,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:15:32,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:15:32,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:15:32,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:15:32,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:15:32,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:15:32,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:15:32,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 06:15:32,916 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:15:32,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:15:32,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:15:32,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:15:32,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:15:32,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:15:32,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:15:32,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:15:32,920 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:15:32,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:15:32,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:15:32,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:15:32,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:15:32,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:15:32,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 06:15:32,924 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 06:15:32,924 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:15:32,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:15:32,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:15:32,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:15:32,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 06:15:32,925 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2021-12-17 06:15:33,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:15:33,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:15:33,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:15:33,212 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:15:33,212 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:15:33,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2021-12-17 06:15:33,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17124607/c1a0f800602b4162a053302c5468e1c3/FLAGf6f4f7eff [2021-12-17 06:15:33,631 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:15:33,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2021-12-17 06:15:33,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17124607/c1a0f800602b4162a053302c5468e1c3/FLAGf6f4f7eff [2021-12-17 06:15:33,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17124607/c1a0f800602b4162a053302c5468e1c3 [2021-12-17 06:15:33,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:15:33,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:15:33,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:15:33,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:15:33,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:15:33,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4283828a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33, skipping insertion in model container [2021-12-17 06:15:33,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:15:33,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:15:33,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2021-12-17 06:15:33,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:15:33,820 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:15:33,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2021-12-17 06:15:33,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:15:33,888 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:15:33,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33 WrapperNode [2021-12-17 06:15:33,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:15:33,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:15:33,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:15:33,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:15:33,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,920 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 70 [2021-12-17 06:15:33,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:15:33,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:15:33,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:15:33,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:15:33,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:15:33,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:15:33,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:15:33,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:15:33,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (1/1) ... [2021-12-17 06:15:33,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:15:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:15:33,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:15:34,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:15:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:15:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2021-12-17 06:15:34,028 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2021-12-17 06:15:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 06:15:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:15:34,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:15:34,089 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:15:34,090 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:15:34,440 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:15:34,444 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:15:34,444 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 06:15:34,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:15:34 BoogieIcfgContainer [2021-12-17 06:15:34,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:15:34,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:15:34,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:15:34,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:15:34,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:15:33" (1/3) ... [2021-12-17 06:15:34,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b18fc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:15:34, skipping insertion in model container [2021-12-17 06:15:34,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:15:33" (2/3) ... [2021-12-17 06:15:34,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b18fc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:15:34, skipping insertion in model container [2021-12-17 06:15:34,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:15:34" (3/3) ... [2021-12-17 06:15:34,459 INFO L111 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2021-12-17 06:15:34,463 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:15:34,463 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:15:34,508 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:15:34,516 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-17 06:15:34,516 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:15:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 06:15:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:15:34,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:34,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:34,533 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2021-12-17 06:15:34,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:15:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288271548] [2021-12-17 06:15:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:34,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:15:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:15:34,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:15:34,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 06:15:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 06:15:34,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:15:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 06:15:34,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:15:34,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:15:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288271548] [2021-12-17 06:15:34,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288271548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:15:34,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:15:34,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 06:15:34,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524603774] [2021-12-17 06:15:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:15:34,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 06:15:34,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:15:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 06:15:34,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 06:15:34,787 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 06:15:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:15:34,805 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2021-12-17 06:15:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 06:15:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-12-17 06:15:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:15:34,812 INFO L225 Difference]: With dead ends: 61 [2021-12-17 06:15:34,812 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 06:15:34,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-17 06:15:34,818 INFO L933 BasicCegarLoop]: 38 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, 38 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-17 06:15:34,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:15:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 06:15:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-17 06:15:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 06:15:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-17 06:15:34,849 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2021-12-17 06:15:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:15:34,850 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-17 06:15:34,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 06:15:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-17 06:15:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:15:34,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:34,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:34,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 06:15:35,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:15:35,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2021-12-17 06:15:35,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:15:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509082702] [2021-12-17 06:15:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:35,088 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:15:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:15:35,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:15:35,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 06:15:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:35,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 06:15:35,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:15:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 06:15:35,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:15:35,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:15:35,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509082702] [2021-12-17 06:15:35,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509082702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:15:35,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:15:35,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 06:15:35,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065242305] [2021-12-17 06:15:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:15:35,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 06:15:35,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:15:35,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 06:15:35,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 06:15:35,626 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 06:15:38,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:15:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:15:38,738 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2021-12-17 06:15:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 06:15:38,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-17 06:15:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:15:38,740 INFO L225 Difference]: With dead ends: 54 [2021-12-17 06:15:38,740 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 06:15:38,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-12-17 06:15:38,741 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-17 06:15:38,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 190 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-12-17 06:15:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 06:15:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2021-12-17 06:15:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 06:15:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2021-12-17 06:15:38,750 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 22 [2021-12-17 06:15:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:15:38,750 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2021-12-17 06:15:38,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 06:15:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2021-12-17 06:15:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:15:38,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:38,751 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:38,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:15:38,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:15:38,960 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash -920184724, now seen corresponding path program 1 times [2021-12-17 06:15:38,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:15:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533205154] [2021-12-17 06:15:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:38,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:15:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:15:38,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:15:38,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 06:15:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:39,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:15:39,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:15:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 06:15:39,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:15:39,334 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:15:39,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533205154] [2021-12-17 06:15:39,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533205154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:15:39,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:15:39,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:15:39,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77089717] [2021-12-17 06:15:39,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:15:39,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:15:39,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:15:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:15:39,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:15:39,335 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 06:15:41,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:15:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:15:41,411 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2021-12-17 06:15:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:15:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-17 06:15:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:15:41,441 INFO L225 Difference]: With dead ends: 85 [2021-12-17 06:15:41,441 INFO L226 Difference]: Without dead ends: 63 [2021-12-17 06:15:41,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-17 06:15:41,442 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:15:41,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-17 06:15:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-17 06:15:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2021-12-17 06:15:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 06:15:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-12-17 06:15:41,449 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2021-12-17 06:15:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:15:41,450 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-12-17 06:15:41,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 06:15:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-12-17 06:15:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 06:15:41,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:41,451 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:41,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 06:15:41,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:15:41,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -961441789, now seen corresponding path program 1 times [2021-12-17 06:15:41,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:15:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202054617] [2021-12-17 06:15:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:41,664 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:15:41,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:15:41,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:15:41,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 06:15:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:41,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 06:15:41,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:15:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 06:15:42,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:15:42,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:15:42,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202054617] [2021-12-17 06:15:42,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202054617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:15:42,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:15:42,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 06:15:42,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66824922] [2021-12-17 06:15:42,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:15:42,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 06:15:42,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:15:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 06:15:42,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 06:15:42,175 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 06:15:45,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:15:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:15:45,238 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2021-12-17 06:15:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 06:15:45,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-12-17 06:15:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:15:45,240 INFO L225 Difference]: With dead ends: 83 [2021-12-17 06:15:45,240 INFO L226 Difference]: Without dead ends: 81 [2021-12-17 06:15:45,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-17 06:15:45,241 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-17 06:15:45,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 217 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-12-17 06:15:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-17 06:15:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2021-12-17 06:15:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 06:15:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-12-17 06:15:45,248 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 52 [2021-12-17 06:15:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:15:45,249 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-12-17 06:15:45,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 06:15:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-12-17 06:15:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 06:15:45,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:15:45,250 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:15:45,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 06:15:45,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:15:45,458 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:15:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:15:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -961382207, now seen corresponding path program 1 times [2021-12-17 06:15:45,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:15:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174949378] [2021-12-17 06:15:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:15:45,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:15:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:15:45,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:15:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 06:15:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:15:45,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 06:15:45,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:16:27,693 WARN L227 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:17:27,024 WARN L860 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (fp.leq ~Z~0 .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0)) ~Z~0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse2 (fp.leq .cse3 .cse4)) (.cse1 (fp.geq .cse3 (fp.neg .cse4)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))) (fp.geq ~Z~0 (fp.neg .cse0))))) is different from true [2021-12-17 06:18:05,973 WARN L838 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 (fp.neg .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0)) ~Z~0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 (fp.neg .cse2)))))))) is different from false [2021-12-17 06:18:07,994 WARN L860 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 (fp.neg .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0)) ~Z~0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 (fp.neg .cse2)))))))) is different from true [2021-12-17 06:18:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2021-12-17 06:18:07,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:18:21,682 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2021-12-17 06:18:23,715 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2021-12-17 06:18:33,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2021-12-17 06:18:35,989 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2021-12-17 06:20:32,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2021-12-17 06:20:59,515 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2021-12-17 06:21:01,548 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2021-12-17 06:21:42,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| (fp.neg .cse2)))))) is different from false [2021-12-17 06:21:44,450 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_10|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| (fp.neg .cse2)))))) is different from true [2021-12-17 06:21:44,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:21:44,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174949378] [2021-12-17 06:21:44,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174949378] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:21:44,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [584943660] [2021-12-17 06:21:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:21:44,451 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 06:21:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 06:21:44,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 06:21:44,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-17 06:21:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:21:45,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 06:21:45,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:23:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2021-12-17 06:23:27,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:25:28,017 WARN L838 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1)))) is different from false [2021-12-17 06:25:30,062 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1)))) is different from true [2021-12-17 06:25:48,419 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq c_~X~0 .cse0)) (not (fp.geq c_~X~0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from false [2021-12-17 06:25:50,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq c_~X~0 .cse0)) (not (fp.geq c_~X~0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from true [2021-12-17 06:26:06,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq c_~I~0 .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))) (not (fp.geq c_~I~0 .cse2))))) is different from false [2021-12-17 06:26:08,946 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq c_~I~0 .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))) (not (fp.geq c_~I~0 .cse2))))) is different from true [2021-12-17 06:26:53,064 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse1)))))) is different from false [2021-12-17 06:26:55,104 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse1)))))) is different from true [2021-12-17 06:27:48,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret6#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_14| (fp.neg .cse2))) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_14| .cse2))))) is different from false [2021-12-17 06:27:50,064 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret6#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |v_ULTIMATE.start_main_#t~ret6#1_14|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_14| (fp.neg .cse2))) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_14| .cse2))))) is different from true [2021-12-17 06:27:50,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [584943660] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:27:50,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:27:50,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2021-12-17 06:27:50,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826720165] [2021-12-17 06:27:50,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:27:50,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 06:27:50,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:27:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 06:27:50,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=132, Unknown=34, NotChecked=420, Total=650 [2021-12-17 06:27:50,067 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 06:28:05,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:08,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:10,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:12,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:14,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:15,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:17,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:19,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:46,266 WARN L227 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:28:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:28:50,594 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2021-12-17 06:28:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 06:28:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-12-17 06:28:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:28:50,596 INFO L225 Difference]: With dead ends: 84 [2021-12-17 06:28:50,596 INFO L226 Difference]: Without dead ends: 82 [2021-12-17 06:28:50,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 135.5s TimeCoverageRelationStatistics Valid=153, Invalid=401, Unknown=46, NotChecked=660, Total=1260 [2021-12-17 06:28:50,597 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 44 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2021-12-17 06:28:50,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 118 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 147 Invalid, 4 Unknown, 142 Unchecked, 14.4s Time] [2021-12-17 06:28:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-17 06:28:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-17 06:28:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-17 06:28:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2021-12-17 06:28:50,608 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 52 [2021-12-17 06:28:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:28:50,610 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2021-12-17 06:28:50,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 06:28:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2021-12-17 06:28:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-17 06:28:50,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:28:50,611 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:28:50,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-12-17 06:28:50,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 06:28:51,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:28:51,042 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:28:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:28:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -77572522, now seen corresponding path program 2 times [2021-12-17 06:28:51,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:28:51,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693343867] [2021-12-17 06:28:51,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 06:28:51,044 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:28:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:28:51,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:28:51,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 06:28:51,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 06:28:51,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:28:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 06:28:51,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:29:33,101 WARN L227 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15