/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6812207659d67444abdc9d105ff32acac8458b5 ......................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6812207659d67444abdc9d105ff32acac8458b5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 14:52:13,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:52:13,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:52:13,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:52:13,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:52:13,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:52:13,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:52:13,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:52:13,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:52:13,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:52:13,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:52:13,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:52:13,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:52:13,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:52:13,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:52:13,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:52:13,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:52:13,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:52:13,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:52:13,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:52:13,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:52:13,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:52:13,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:52:13,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:52:13,233 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:52:13,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:52:13,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:52:13,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:52:13,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:52:13,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:52:13,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:52:13,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:52:13,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:52:13,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:52:13,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:52:13,243 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:52:13,244 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:52:13,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:52:13,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:52:13,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:52:13,261 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:52:13,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:52:13,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:52:13,263 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:52:13,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:52:13,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:52:13,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:52:13,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:52:13,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:52:13,265 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:52:13,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:52:13,265 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:52:13,265 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:52:13,265 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:52:13,266 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:52:13,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:52:13,267 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:52:13,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:52:13,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:52:13,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:52:13,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:52:13,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:52:13,268 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:52:13,268 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:52:13,268 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:52:13,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:52:13,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_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 -> e6812207659d67444abdc9d105ff32acac8458b5 [2018-09-20 14:52:13,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:52:13,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:52:13,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:52:13,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:52:13,340 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:52:13,341 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-20 14:52:13,714 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc19684/2161110e2b4b49378c34a6740e261572/FLAGe0105f219 [2018-09-20 14:52:13,929 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:52:13,930 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-20 14:52:13,949 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc19684/2161110e2b4b49378c34a6740e261572/FLAGe0105f219 [2018-09-20 14:52:13,967 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cc19684/2161110e2b4b49378c34a6740e261572 [2018-09-20 14:52:13,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:52:13,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:52:13,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:52:13,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:52:13,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:52:13,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:52:13" (1/1) ... [2018-09-20 14:52:13,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4131ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:13, skipping insertion in model container [2018-09-20 14:52:13,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:52:13" (1/1) ... [2018-09-20 14:52:14,000 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:52:14,398 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$37(StandardFunctionHandler.java:260) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:160) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1549) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:513) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1928) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1748) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1725) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:339) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3980) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2445) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:183) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.preRun(MainDispatcher.java:348) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.Dispatcher.run(Dispatcher.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.doTranslation(CACSL2BoogieTranslatorObserver.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:152) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-20 14:52:14,404 INFO L168 Benchmark]: Toolchain (without parser) took 432.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:52:14,407 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:52:14,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:52:14,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 14:52:16,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:52:16,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:52:16,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:52:16,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:52:16,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:52:16,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:52:16,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:52:16,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:52:16,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:52:16,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:52:16,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:52:16,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:52:16,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:52:16,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:52:16,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:52:16,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:52:16,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:52:16,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:52:16,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:52:16,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:52:16,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:52:16,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:52:16,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:52:16,636 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:52:16,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:52:16,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:52:16,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:52:16,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:52:16,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:52:16,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:52:16,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:52:16,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:52:16,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:52:16,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:52:16,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:52:16,644 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:52:16,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:52:16,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:52:16,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:52:16,662 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:52:16,663 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:52:16,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:52:16,663 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:52:16,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:52:16,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:52:16,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:52:16,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:52:16,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:52:16,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:52:16,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:52:16,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:52:16,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:52:16,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:52:16,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:52:16,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:52:16,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:52:16,667 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:52:16,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_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 -> e6812207659d67444abdc9d105ff32acac8458b5 [2018-09-20 14:52:16,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:52:16,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:52:16,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:52:16,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:52:16,767 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:52:16,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-20 14:52:17,127 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5231b1bd/1e52c4f02457457d819cb676538e9499/FLAG3602d6755 [2018-09-20 14:52:17,428 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:52:17,430 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-09-20 14:52:17,448 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5231b1bd/1e52c4f02457457d819cb676538e9499/FLAG3602d6755 [2018-09-20 14:52:17,464 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5231b1bd/1e52c4f02457457d819cb676538e9499 [2018-09-20 14:52:17,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:52:17,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:52:17,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:52:17,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:52:17,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:52:17,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:52:17" (1/1) ... [2018-09-20 14:52:17,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e052425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:17, skipping insertion in model container [2018-09-20 14:52:17,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:52:17" (1/1) ... [2018-09-20 14:52:17,497 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:52:17,947 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:52:17,971 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:52:18,173 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:52:18,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18 WrapperNode [2018-09-20 14:52:18,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:52:18,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:52:18,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:52:18,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:52:18,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... [2018-09-20 14:52:18,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:52:18,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:52:18,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:52:18,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:52:18,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:52:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:52:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:52:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-20 14:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-20 14:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-20 14:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-20 14:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-20 14:52:18,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 14:52:18,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:52:18,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:52:18,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:52:18,581 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-20 14:52:18,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 14:52:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 14:52:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 14:52:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 14:52:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 14:52:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 14:52:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-20 14:52:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-20 14:52:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-20 14:52:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-20 14:52:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 14:52:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:52:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:52:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:52:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 14:52:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 14:52:19,067 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:19,685 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:19,722 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:20,249 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:20,273 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:21,249 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,483 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,640 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,683 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,805 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,847 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:22,895 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:23,082 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:25,559 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:25,611 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:28,303 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:30,497 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:32,877 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:34,964 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:37,160 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:37,175 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:37,217 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:37,272 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:37,325 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:38,713 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:45,036 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:45,078 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:45,163 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:45,239 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:45,693 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:48,721 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:48,753 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:52:48,825 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:04,312 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,151 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,162 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,209 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,225 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,415 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,452 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:05,490 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:09,827 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:09,868 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:09,985 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:53:12,007 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:53:12,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:53:12 BoogieIcfgContainer [2018-09-20 14:53:12,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:53:12,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:53:12,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:53:12,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:53:12,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:52:17" (1/3) ... [2018-09-20 14:53:12,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32550f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:53:12, skipping insertion in model container [2018-09-20 14:53:12,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:52:18" (2/3) ... [2018-09-20 14:53:12,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32550f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:53:12, skipping insertion in model container [2018-09-20 14:53:12,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:53:12" (3/3) ... [2018-09-20 14:53:12,024 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0882_true-unreach-call.c [2018-09-20 14:53:12,037 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:53:12,045 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:53:12,100 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:53:12,101 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:53:12,101 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:53:12,101 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:53:12,101 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:53:12,101 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:53:12,101 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:53:12,102 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:53:12,102 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:53:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states. [2018-09-20 14:53:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 14:53:12,154 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:53:12,155 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:53:12,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:53:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash -83967081, now seen corresponding path program 1 times [2018-09-20 14:53:12,170 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:53:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 14:53:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:53:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:53:12,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:53:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:53:12,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:53:12,488 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:53:12,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:53:12,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:53:12,508 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:53:12,508 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:53:12,510 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 2 states. [2018-09-20 14:53:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:53:12,596 INFO L93 Difference]: Finished difference Result 1017 states and 1309 transitions. [2018-09-20 14:53:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:53:12,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 14:53:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:53:12,620 INFO L225 Difference]: With dead ends: 1017 [2018-09-20 14:53:12,621 INFO L226 Difference]: Without dead ends: 508 [2018-09-20 14:53:12,635 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:53:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-09-20 14:53:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-09-20 14:53:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-20 14:53:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 589 transitions. [2018-09-20 14:53:12,755 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 589 transitions. Word has length 19 [2018-09-20 14:53:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:53:12,756 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 589 transitions. [2018-09-20 14:53:12,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:53:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 589 transitions. [2018-09-20 14:53:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-20 14:53:12,758 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:53:12,759 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:53:12,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:53:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1192673683, now seen corresponding path program 1 times [2018-09-20 14:53:12,762 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:53:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 14:53:12,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:53:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:53:13,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:53:13,181 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:53:13,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:53:13,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 14:53:13,216 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:53:13,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 14:53:13,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:53:13,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:53:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:53:13,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 14:53:13,600 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:53:13,601 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:53:13,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 14:53:13,617 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:53:13,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 14:53:13,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:53:13,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:53:13,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:53:13,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 14:53:13,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 14:53:13,961 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:53:13,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 14:53:13,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:53:13,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:53:14,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:53:14,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 14:53:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:53:14,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:53:14,477 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:53:14,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 14:53:14,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 14:53:14,483 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 14:53:14,483 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-20 14:53:14,483 INFO L87 Difference]: Start difference. First operand 508 states and 589 transitions. Second operand 11 states. [2018-09-20 14:53:15,724 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 14:53:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:53:39,572 INFO L93 Difference]: Finished difference Result 537 states and 621 transitions. [2018-09-20 14:53:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 14:53:39,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-09-20 14:53:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:53:39,588 INFO L225 Difference]: With dead ends: 537 [2018-09-20 14:53:39,589 INFO L226 Difference]: Without dead ends: 514 [2018-09-20 14:53:39,591 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-20 14:53:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-09-20 14:53:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 508. [2018-09-20 14:53:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-20 14:53:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 588 transitions. [2018-09-20 14:53:39,644 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 588 transitions. Word has length 45 [2018-09-20 14:53:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:53:39,644 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 588 transitions. [2018-09-20 14:53:39,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 14:53:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 588 transitions. [2018-09-20 14:53:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 14:53:39,646 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:53:39,646 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:53:39,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:53:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -444726217, now seen corresponding path program 1 times [2018-09-20 14:53:39,649 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:53:39,649 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 14:53:39,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:53:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:53:39,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:53:39,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:53:39,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:53:39,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:53:39,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:53:39,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:53:39,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:53:40,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:53:40,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:53:40,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:53:40,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:53:40,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:53:40,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:53:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:53:40,386 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:53:40,401 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:53:40,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:53:40,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:53:40,402 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:53:40,402 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:53:40,404 INFO L87 Difference]: Start difference. First operand 508 states and 588 transitions. Second operand 9 states. [2018-09-20 14:53:40,725 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 14:53:41,477 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 14:53:41,675 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 14:54:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:54:02,701 INFO L93 Difference]: Finished difference Result 631 states and 722 transitions. [2018-09-20 14:54:02,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 14:54:02,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-09-20 14:54:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:54:02,708 INFO L225 Difference]: With dead ends: 631 [2018-09-20 14:54:02,708 INFO L226 Difference]: Without dead ends: 608 [2018-09-20 14:54:02,709 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:54:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-20 14:54:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 508. [2018-09-20 14:54:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-20 14:54:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 586 transitions. [2018-09-20 14:54:02,737 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 586 transitions. Word has length 47 [2018-09-20 14:54:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:54:02,737 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 586 transitions. [2018-09-20 14:54:02,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:54:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 586 transitions. [2018-09-20 14:54:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 14:54:02,740 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:54:02,741 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:54:02,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:54:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 442777464, now seen corresponding path program 1 times [2018-09-20 14:54:02,742 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:54:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 14:54:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:54:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:54:03,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:54:03,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:03,273 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:03,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 14:54:03,308 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:03,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 14:54:03,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:03,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:03,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:03,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-09-20 14:54:03,838 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:03,841 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:03,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 14:54:03,858 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:03,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 14:54:03,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:03,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:04,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:04,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-09-20 14:54:04,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 14:54:04,177 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:04,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 14:54:04,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:04,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:04,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:04,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-09-20 14:54:04,511 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:04,511 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:04,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 14:54:04,525 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 14:54:04,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:04,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:04,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:04,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-09-20 14:54:05,171 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:05,172 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:54:05,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 14:54:05,224 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:05,298 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-09-20 14:54:05,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 14:54:05,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:05,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:05,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:05,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-09-20 14:54:05,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 14:54:05,582 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:54:05,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 14:54:05,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:54:05,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:54:05,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:54:05,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:35 [2018-09-20 14:54:06,655 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2018-09-20 14:54:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:54:06,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:54:06,722 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:54:06,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 14:54:06,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 14:54:06,724 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 14:54:06,724 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-20 14:54:06,725 INFO L87 Difference]: Start difference. First operand 508 states and 586 transitions. Second operand 17 states. [2018-09-20 14:54:08,494 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 14:54:08,916 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 14:54:09,691 WARN L178 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 14:54:10,392 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-20 14:54:10,707 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-20 14:54:11,170 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-20 14:54:11,525 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-20 14:54:11,839 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 14:54:12,450 WARN L178 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-20 14:54:13,193 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 14:54:13,924 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 14:54:14,806 WARN L178 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-20 14:55:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:55:31,739 INFO L93 Difference]: Finished difference Result 639 states and 731 transitions. [2018-09-20 14:55:31,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-20 14:55:31,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-09-20 14:55:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:55:31,745 INFO L225 Difference]: With dead ends: 639 [2018-09-20 14:55:31,745 INFO L226 Difference]: Without dead ends: 615 [2018-09-20 14:55:31,746 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 14:55:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-09-20 14:55:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 507. [2018-09-20 14:55:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-09-20 14:55:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 584 transitions. [2018-09-20 14:55:31,774 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 584 transitions. Word has length 47 [2018-09-20 14:55:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:55:31,775 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 584 transitions. [2018-09-20 14:55:31,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 14:55:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 584 transitions. [2018-09-20 14:55:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-20 14:55:31,778 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:55:31,778 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:55:31,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:55:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash 801540408, now seen corresponding path program 1 times [2018-09-20 14:55:31,779 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:55:31,779 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:55:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 14:55:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:55:32,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:55:35,376 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-20 14:55:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:55:35,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:55:35,470 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:55:35,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:55:35,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:55:35,471 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:55:35,471 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-20 14:55:35,471 INFO L87 Difference]: Start difference. First operand 507 states and 584 transitions. Second operand 8 states. [2018-09-20 14:55:47,651 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= c___ieee754_pow_~x |c___ieee754_pow_#in~x|) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-20 14:56:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:56:03,242 INFO L93 Difference]: Finished difference Result 606 states and 694 transitions. [2018-09-20 14:56:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:56:03,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-09-20 14:56:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:56:03,248 INFO L225 Difference]: With dead ends: 606 [2018-09-20 14:56:03,248 INFO L226 Difference]: Without dead ends: 603 [2018-09-20 14:56:03,249 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2018-09-20 14:56:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-09-20 14:56:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 511. [2018-09-20 14:56:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-20 14:56:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 588 transitions. [2018-09-20 14:56:03,278 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 588 transitions. Word has length 51 [2018-09-20 14:56:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:56:03,278 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 588 transitions. [2018-09-20 14:56:03,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:56:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 588 transitions. [2018-09-20 14:56:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-20 14:56:03,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:56:03,281 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:56:03,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:56:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1689044089, now seen corresponding path program 1 times [2018-09-20 14:56:03,282 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:56:03,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 14:56:03,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:56:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:56:03,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:56:03,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:56:03,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:56:03,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:03,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:03,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:03,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:56:03,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:56:03,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:56:03,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:03,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:03,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:56:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:56:03,938 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:56:03,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:56:03,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 14:56:03,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 14:56:03,951 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 14:56:03,952 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-20 14:56:03,952 INFO L87 Difference]: Start difference. First operand 511 states and 588 transitions. Second operand 10 states. [2018-09-20 14:56:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:56:27,026 INFO L93 Difference]: Finished difference Result 541 states and 621 transitions. [2018-09-20 14:56:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 14:56:27,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-09-20 14:56:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:56:27,033 INFO L225 Difference]: With dead ends: 541 [2018-09-20 14:56:27,033 INFO L226 Difference]: Without dead ends: 518 [2018-09-20 14:56:27,034 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-20 14:56:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-09-20 14:56:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 511. [2018-09-20 14:56:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-20 14:56:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 587 transitions. [2018-09-20 14:56:27,065 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 587 transitions. Word has length 51 [2018-09-20 14:56:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:56:27,066 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 587 transitions. [2018-09-20 14:56:27,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 14:56:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 587 transitions. [2018-09-20 14:56:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-20 14:56:27,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:56:27,069 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:56:27,069 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:56:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1068208600, now seen corresponding path program 1 times [2018-09-20 14:56:27,071 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:56:27,071 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:56:27,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 14:56:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:56:27,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:56:27,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:56:27,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:56:27,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:27,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:27,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:27,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:56:27,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:56:27,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:56:27,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:27,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:27,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:27,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:56:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:56:27,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:56:27,842 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:56:27,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:56:27,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:56:27,843 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:56:27,843 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:56:27,844 INFO L87 Difference]: Start difference. First operand 511 states and 587 transitions. Second operand 8 states. [2018-09-20 14:56:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:56:53,704 INFO L93 Difference]: Finished difference Result 536 states and 612 transitions. [2018-09-20 14:56:53,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:56:53,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-09-20 14:56:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:56:53,709 INFO L225 Difference]: With dead ends: 536 [2018-09-20 14:56:53,709 INFO L226 Difference]: Without dead ends: 513 [2018-09-20 14:56:53,710 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:56:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-20 14:56:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2018-09-20 14:56:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-09-20 14:56:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 586 transitions. [2018-09-20 14:56:53,739 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 586 transitions. Word has length 51 [2018-09-20 14:56:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:56:53,740 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 586 transitions. [2018-09-20 14:56:53,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:56:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 586 transitions. [2018-09-20 14:56:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 14:56:53,741 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:56:53,741 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-09-20 14:56:53,741 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:56:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -920553107, now seen corresponding path program 1 times [2018-09-20 14:56:53,744 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:56:53,744 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:56:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 14:56:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:56:54,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:56:54,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:56:54,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:56:54,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:54,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:54,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:54,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:56:54,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:56:54,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:56:54,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:56:54,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:56:54,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:56:54,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:56:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:56:54,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:56:54,492 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:56:54,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:56:54,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:56:54,493 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:56:54,494 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:56:54,494 INFO L87 Difference]: Start difference. First operand 511 states and 586 transitions. Second operand 9 states. [2018-09-20 14:56:55,205 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 14:57:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:57:15,651 INFO L93 Difference]: Finished difference Result 720 states and 811 transitions. [2018-09-20 14:57:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 14:57:15,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-09-20 14:57:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:57:15,659 INFO L225 Difference]: With dead ends: 720 [2018-09-20 14:57:15,660 INFO L226 Difference]: Without dead ends: 687 [2018-09-20 14:57:15,660 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:57:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-20 14:57:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 507. [2018-09-20 14:57:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-09-20 14:57:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 576 transitions. [2018-09-20 14:57:15,697 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 576 transitions. Word has length 53 [2018-09-20 14:57:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:57:15,698 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 576 transitions. [2018-09-20 14:57:15,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:57:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 576 transitions. [2018-09-20 14:57:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 14:57:15,699 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:57:15,699 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-09-20 14:57:15,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:57:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1086505061, now seen corresponding path program 1 times [2018-09-20 14:57:15,700 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:57:15,702 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 14:57:15,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:57:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:57:15,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:57:15,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:57:15,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:57:15,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:57:15,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:57:15,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:57:15,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:57:16,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:57:16,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:57:16,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:57:16,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:57:16,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:57:16,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:57:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:57:16,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:57:16,279 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:57:16,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:57:16,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:57:16,280 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:57:16,280 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:57:16,280 INFO L87 Difference]: Start difference. First operand 507 states and 576 transitions. Second operand 8 states. [2018-09-20 14:57:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:57:55,784 INFO L93 Difference]: Finished difference Result 676 states and 763 transitions. [2018-09-20 14:57:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:57:55,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-20 14:57:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:57:55,789 INFO L225 Difference]: With dead ends: 676 [2018-09-20 14:57:55,789 INFO L226 Difference]: Without dead ends: 573 [2018-09-20 14:57:55,790 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:57:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-09-20 14:57:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 446. [2018-09-20 14:57:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-09-20 14:57:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 494 transitions. [2018-09-20 14:57:55,824 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 494 transitions. Word has length 53 [2018-09-20 14:57:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:57:55,825 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 494 transitions. [2018-09-20 14:57:55,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:57:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 494 transitions. [2018-09-20 14:57:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 14:57:55,828 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:57:55,829 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-09-20 14:57:55,829 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:57:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 277158435, now seen corresponding path program 1 times [2018-09-20 14:57:55,829 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:57:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 14:57:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:57:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:57:56,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:57:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:57:56,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:57:56,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:57:56,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-20 14:57:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-20 14:57:56,198 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-20 14:57:56,199 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-20 14:57:56,199 INFO L87 Difference]: Start difference. First operand 446 states and 494 transitions. Second operand 7 states. [2018-09-20 14:58:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:58:16,884 INFO L93 Difference]: Finished difference Result 453 states and 501 transitions. [2018-09-20 14:58:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-20 14:58:16,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-09-20 14:58:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:58:16,888 INFO L225 Difference]: With dead ends: 453 [2018-09-20 14:58:16,888 INFO L226 Difference]: Without dead ends: 450 [2018-09-20 14:58:16,889 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:58:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-09-20 14:58:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2018-09-20 14:58:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-09-20 14:58:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 494 transitions. [2018-09-20 14:58:16,922 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 494 transitions. Word has length 53 [2018-09-20 14:58:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:58:16,924 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 494 transitions. [2018-09-20 14:58:16,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-20 14:58:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 494 transitions. [2018-09-20 14:58:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-20 14:58:16,925 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:58:16,925 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:58:16,925 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:58:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 63571582, now seen corresponding path program 1 times [2018-09-20 14:58:16,928 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:58:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:58:16,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 14:58:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:58:18,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:58:20,585 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-20 14:58:20,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:58:20,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:58:20,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:58:20,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:58:20,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:58:20,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:58:20,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:58:20,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:58:20,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:58:20,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:58:20,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:58:20,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:58:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:58:21,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:58:21,252 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:58:21,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-20 14:58:21,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-20 14:58:21,253 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-20 14:58:21,253 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2018-09-20 14:58:21,254 INFO L87 Difference]: Start difference. First operand 446 states and 494 transitions. Second operand 15 states. [2018-09-20 14:58:30,795 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 14:58:31,649 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 14:58:32,517 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 14:58:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:58:49,560 INFO L93 Difference]: Finished difference Result 538 states and 594 transitions. [2018-09-20 14:58:49,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-20 14:58:49,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-09-20 14:58:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:58:49,565 INFO L225 Difference]: With dead ends: 538 [2018-09-20 14:58:49,565 INFO L226 Difference]: Without dead ends: 514 [2018-09-20 14:58:49,566 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=148, Invalid=725, Unknown=1, NotChecked=56, Total=930 [2018-09-20 14:58:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-09-20 14:58:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 445. [2018-09-20 14:58:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-20 14:58:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 492 transitions. [2018-09-20 14:58:49,600 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 492 transitions. Word has length 67 [2018-09-20 14:58:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:58:49,600 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 492 transitions. [2018-09-20 14:58:49,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-20 14:58:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 492 transitions. [2018-09-20 14:58:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-20 14:58:49,601 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:58:49,602 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:58:49,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:58:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1096245609, now seen corresponding path program 1 times [2018-09-20 14:58:49,605 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:58:49,605 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:58:49,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 14:58:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:58:49,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:58:49,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:58:50,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:58:50,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:58:50,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:58:50,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:58:50,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:58:50,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:58:50,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:58:50,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:58:50,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:58:50,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:58:50,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:58:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:58:50,907 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:58:50,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:58:50,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 14:58:50,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 14:58:50,921 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 14:58:50,921 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:58:50,921 INFO L87 Difference]: Start difference. First operand 445 states and 492 transitions. Second operand 14 states. [2018-09-20 14:58:59,062 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 14:58:59,471 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 14:59:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:59:14,166 INFO L93 Difference]: Finished difference Result 452 states and 499 transitions. [2018-09-20 14:59:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 14:59:14,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-09-20 14:59:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:59:14,172 INFO L225 Difference]: With dead ends: 452 [2018-09-20 14:59:14,172 INFO L226 Difference]: Without dead ends: 439 [2018-09-20 14:59:14,173 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-09-20 14:59:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-20 14:59:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2018-09-20 14:59:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-20 14:59:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 483 transitions. [2018-09-20 14:59:14,209 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 483 transitions. Word has length 69 [2018-09-20 14:59:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:59:14,209 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 483 transitions. [2018-09-20 14:59:14,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 14:59:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 483 transitions. [2018-09-20 14:59:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-20 14:59:14,212 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:59:14,212 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:59:14,213 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:59:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1774528776, now seen corresponding path program 1 times [2018-09-20 14:59:14,213 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:59:14,213 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:59:14,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 14:59:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:59:15,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:59:15,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:59:15,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:59:15,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:15,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:15,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:15,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:59:15,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:59:15,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:59:15,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:15,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:15,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:15,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:59:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:59:15,951 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:59:15,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:59:15,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 14:59:15,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 14:59:15,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 14:59:15,976 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-20 14:59:15,976 INFO L87 Difference]: Start difference. First operand 437 states and 483 transitions. Second operand 10 states. [2018-09-20 14:59:17,284 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 14:59:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:59:36,018 INFO L93 Difference]: Finished difference Result 560 states and 617 transitions. [2018-09-20 14:59:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 14:59:36,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-09-20 14:59:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:59:36,022 INFO L225 Difference]: With dead ends: 560 [2018-09-20 14:59:36,022 INFO L226 Difference]: Without dead ends: 344 [2018-09-20 14:59:36,023 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-20 14:59:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-09-20 14:59:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 334. [2018-09-20 14:59:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-20 14:59:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 371 transitions. [2018-09-20 14:59:36,042 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 371 transitions. Word has length 78 [2018-09-20 14:59:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:59:36,043 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 371 transitions. [2018-09-20 14:59:36,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 14:59:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 371 transitions. [2018-09-20 14:59:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-20 14:59:36,046 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:59:36,046 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:59:36,047 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:59:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash 481652512, now seen corresponding path program 1 times [2018-09-20 14:59:36,047 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:59:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:59:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 14:59:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:59:37,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:59:37,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:59:37,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:59:37,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:37,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-20 14:59:37,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:59:37,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:59:37,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:37,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-20 14:59:37,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 14:59:37,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:59:37,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:37,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:37,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-20 14:59:38,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 14:59:38,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:59:38,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:38,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:38,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:38,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-20 14:59:38,879 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 14:59:39,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-09-20 14:59:39,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-09-20 14:59:39,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:39,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-20 14:59:39,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-09-20 14:59:39,230 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:59:39,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-09-20 14:59:39,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:39,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-09-20 14:59:39,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-09-20 14:59:39,482 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:59:39,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2018-09-20 14:59:39,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:59:39,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:59:39,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:51 [2018-09-20 14:59:43,310 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= c___ieee754_pow_~z~1 (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))))) (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 14:59:45,743 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_61| (_ BitVec 64)) (|v_q#valueAsBitvector_60| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_61|) ((_ extract 62 52) |v_q#valueAsBitvector_61|) ((_ extract 51 0) |v_q#valueAsBitvector_61|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_60|) ((_ extract 62 52) |v_q#valueAsBitvector_60|) ((_ extract 51 0) |v_q#valueAsBitvector_60|)) |c___ieee754_pow_#in~x|) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_60|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_61|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))))) (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-20 15:00:04,157 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2018-09-20 15:00:04,159 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:732) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:338) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-09-20 15:00:04,164 INFO L168 Benchmark]: Toolchain (without parser) took 466695.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:00:04,165 INFO L168 Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:00:04,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:00:04,166 INFO L168 Benchmark]: Boogie Preprocessor took 236.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 919.6 MB in the beginning and 1.1 GB in the end (delta: -223.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:00:04,166 INFO L168 Benchmark]: RCFGBuilder took 53540.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:00:04,166 INFO L168 Benchmark]: TraceAbstraction took 412153.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -98.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:00:04,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 757.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 236.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 919.6 MB in the beginning and 1.1 GB in the end (delta: -223.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 53540.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412153.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -98.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...