/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 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_1251a_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 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ........................................................................................................................................................................................................................................................................................................................................................................................... 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_1251a_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 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:12:51,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:12:51,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:12:51,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:12:51,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:12:51,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:12:51,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:12:51,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:12:51,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:12:51,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:12:51,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:12:51,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:12:51,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:12:51,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:12:51,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:12:51,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:12:51,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:12:51,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:12:51,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:12:51,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:12:51,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:12:51,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:12:51,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:12:51,833 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:12:51,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:12:51,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:12:51,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:12:51,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:12:51,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:12:51,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:12:51,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:12:51,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:12:51,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:12:51,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:12:51,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:12:51,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:12:51,851 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:12:51,867 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:12:51,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:12:51,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:12:51,870 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:12:51,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:12:51,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:12:51,871 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:12:51,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:12:51,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:12:51,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:12:51,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:12:51,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:12:51,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:12:51,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:12:51,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:12:51,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:12:51,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:12:51,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:12:51,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:12:51,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:12:51,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:12:51,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:12:51,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:12:51,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:12:51,877 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 -> 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:12:51,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:12:51,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:12:51,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:12:51,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:12:51,987 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:12:51,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:52,353 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0a8f182/556daa21623240af99be248103ea9fc0/FLAGec07d388f [2018-09-21 18:12:52,514 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:12:52,515 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:52,523 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0a8f182/556daa21623240af99be248103ea9fc0/FLAGec07d388f [2018-09-21 18:12:52,540 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0a8f182/556daa21623240af99be248103ea9fc0 [2018-09-21 18:12:52,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:12:52,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:12:52,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:12:52,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:12:52,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:12:52,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223424f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52, skipping insertion in model container [2018-09-21 18:12:52,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,576 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:12:52,791 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:12:52,806 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:12:52,821 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:12:52,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52 WrapperNode [2018-09-21 18:12:52,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:12:52,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:12:52,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:12:52,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:12:52,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (1/1) ... [2018-09-21 18:12:52,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:12:52,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:12:52,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:12:52,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:12:52,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (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-21 18:12:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:12:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:12:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-21 18:12:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-21 18:12:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-21 18:12:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:12:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:12:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:12:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-21 18:12:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-21 18:12:53,640 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:12:53,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:12:53 BoogieIcfgContainer [2018-09-21 18:12:53,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:12:53,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:12:53,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:12:53,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:12:53,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:12:52" (1/3) ... [2018-09-21 18:12:53,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdeb626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:12:53, skipping insertion in model container [2018-09-21 18:12:53,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:52" (2/3) ... [2018-09-21 18:12:53,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdeb626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:12:53, skipping insertion in model container [2018-09-21 18:12:53,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:12:53" (3/3) ... [2018-09-21 18:12:53,649 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:53,661 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:12:53,670 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:12:53,720 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:12:53,721 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:12:53,721 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:12:53,721 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:12:53,721 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:12:53,721 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:12:53,722 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:12:53,722 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:12:53,722 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:12:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-09-21 18:12:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-21 18:12:53,751 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:53,752 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] [2018-09-21 18:12:53,754 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 754859581, now seen corresponding path program 1 times [2018-09-21 18:12:53,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:12:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:12:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:53,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:53,922 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-21 18:12:53,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:53,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:12:53,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:12:53,948 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:12:53,949 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:12:53,952 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-09-21 18:12:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:53,977 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-09-21 18:12:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:12:53,979 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-21 18:12:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:53,991 INFO L225 Difference]: With dead ends: 54 [2018-09-21 18:12:53,991 INFO L226 Difference]: Without dead ends: 49 [2018-09-21 18:12:53,993 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:12:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-21 18:12:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-21 18:12:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:12:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-21 18:12:54,050 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-09-21 18:12:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:54,051 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-21 18:12:54,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:12:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-21 18:12:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-21 18:12:54,054 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:54,055 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] [2018-09-21 18:12:54,055 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash -952121448, now seen corresponding path program 1 times [2018-09-21 18:12:54,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:12:54,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:12:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:54,300 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-21 18:12:54,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:54,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:12:54,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:12:54,303 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:12:54,304 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:54,304 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-21 18:12:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:54,466 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-09-21 18:12:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:12:54,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-21 18:12:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:54,471 INFO L225 Difference]: With dead ends: 53 [2018-09-21 18:12:54,472 INFO L226 Difference]: Without dead ends: 53 [2018-09-21 18:12:54,473 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-21 18:12:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-21 18:12:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-21 18:12:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-21 18:12:54,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2018-09-21 18:12:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:54,488 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-21 18:12:54,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:12:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-21 18:12:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-21 18:12:54,492 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:54,492 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] [2018-09-21 18:12:54,493 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1784721648, now seen corresponding path program 1 times [2018-09-21 18:12:54,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:12:54,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:12:54,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:54,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:54,658 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-21 18:12:54,659 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:54,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:12:54,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:12:54,660 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:12:54,660 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:54,661 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-21 18:12:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:54,760 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-09-21 18:12:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:12:54,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-09-21 18:12:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:54,766 INFO L225 Difference]: With dead ends: 57 [2018-09-21 18:12:54,766 INFO L226 Difference]: Without dead ends: 57 [2018-09-21 18:12:54,767 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-21 18:12:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-21 18:12:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-21 18:12:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-21 18:12:54,776 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 43 [2018-09-21 18:12:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:54,777 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-21 18:12:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:12:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-21 18:12:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-21 18:12:54,779 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:54,780 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] [2018-09-21 18:12:54,780 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1981235153, now seen corresponding path program 1 times [2018-09-21 18:12:54,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:12:54,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:12:54,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:12:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:12:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:12:54,869 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-21 18:12:54,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:12:54 BoogieIcfgContainer [2018-09-21 18:12:54,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:12:54,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:12:54,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:12:54,905 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:12:54,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:12:53" (3/4) ... [2018-09-21 18:12:54,911 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-21 18:12:54,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:12:54,912 INFO L168 Benchmark]: Toolchain (without parser) took 2365.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -117.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:54,914 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-21 18:12:54,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.42 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:54,915 INFO L168 Benchmark]: Boogie Preprocessor took 56.92 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:12:54,916 INFO L168 Benchmark]: RCFGBuilder took 725.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:54,917 INFO L168 Benchmark]: TraceAbstraction took 1263.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:12:54,918 INFO L168 Benchmark]: Witness Printer took 5.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:12:54,923 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 307.42 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.92 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 725.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1263.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L64] double x = 0.0 / 0.0; [L65] double y = __VERIFIER_nondet_double(); [L72] CALL, EXPR isnan_double(y) VAL [\old(x)=4294967300] [L16] RET return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L72] EXPR isnan_double(y) VAL [isnan_double(y)=0, y=4294967300] [L72] COND TRUE !isnan_double(y) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967300] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L31] FCALL ew_u.value = (x) VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L32] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, x=4294967302] [L32] (msw) = ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L32] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967301, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L33] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, msw=4293918721, x=4294967302] [L33] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L33] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967304, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L34] COND FALSE !(0) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] RET return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967302, y=4294967300] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] RET return y; VAL [\old(x)=4294967302, \old(y)=4294967300, \result=4294967300, x=4294967302, y=4294967300] [L74] EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967300, x=4294967302, y=4294967300] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != y VAL [res=4294967300, x=4294967302, y=4294967300] [L78] __VERIFIER_error() VAL [res=4294967300, x=4294967302, y=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 210 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:12:57,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:12:57,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:12:57,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:12:57,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:12:57,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:12:57,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:12:57,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:12:57,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:12:57,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:12:57,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:12:57,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:12:57,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:12:57,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:12:57,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:12:57,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:12:57,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:12:57,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:12:57,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:12:57,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:12:57,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:12:57,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:12:57,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:12:57,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:12:57,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:12:57,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:12:57,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:12:57,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:12:57,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:12:57,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:12:57,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:12:57,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:12:57,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:12:57,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:12:57,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:12:57,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:12:57,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:12:57,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:12:57,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:12:57,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:12:57,296 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:12:57,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:12:57,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:12:57,298 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:12:57,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:12:57,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:12:57,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:12:57,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:12:57,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:12:57,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:12:57,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:12:57,299 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:12:57,299 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:12:57,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:12:57,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:12:57,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:12:57,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:12:57,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:12:57,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:12:57,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:12:57,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:12:57,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:12:57,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:12:57,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:12:57,303 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:12:57,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:12:57,303 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:12:57,303 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:12:57,303 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 -> 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:12:57,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:12:57,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:12:57,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:12:57,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:12:57,376 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:12:57,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:57,724 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17b72cf8/25c6c5120bd4416bbf87615318069153/FLAG81ea0d3c1 [2018-09-21 18:12:57,876 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:12:57,877 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:57,884 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17b72cf8/25c6c5120bd4416bbf87615318069153/FLAG81ea0d3c1 [2018-09-21 18:12:57,898 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17b72cf8/25c6c5120bd4416bbf87615318069153 [2018-09-21 18:12:57,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:12:57,904 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:12:57,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:12:57,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:12:57,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:12:57,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:12:57" (1/1) ... [2018-09-21 18:12:57,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35afef43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:57, skipping insertion in model container [2018-09-21 18:12:57,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:12:57" (1/1) ... [2018-09-21 18:12:57,935 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:12:58,199 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:12:58,221 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:12:58,243 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:12:58,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58 WrapperNode [2018-09-21 18:12:58,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:12:58,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:12:58,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:12:58,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:12:58,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (1/1) ... [2018-09-21 18:12:58,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:12:58,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:12:58,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:12:58,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:12:58,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (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-21 18:12:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:12:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:12:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-21 18:12:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-21 18:12:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-21 18:12:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:12:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:12:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 18:12:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-21 18:12:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-21 18:12:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:12:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-21 18:12:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:12:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:12:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-21 18:12:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:12:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:12:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:12:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-21 18:12:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:12:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:12:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-21 18:12:58,877 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:12:58,911 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:12:58,930 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:12:59,086 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:12:59,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:12:59 BoogieIcfgContainer [2018-09-21 18:12:59,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:12:59,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:12:59,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:12:59,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:12:59,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:12:57" (1/3) ... [2018-09-21 18:12:59,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21498ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:12:59, skipping insertion in model container [2018-09-21 18:12:59,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:12:58" (2/3) ... [2018-09-21 18:12:59,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21498ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:12:59, skipping insertion in model container [2018-09-21 18:12:59,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:12:59" (3/3) ... [2018-09-21 18:12:59,098 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251a_true-unreach-call.c [2018-09-21 18:12:59,108 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:12:59,117 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:12:59,166 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:12:59,166 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:12:59,167 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:12:59,167 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:12:59,167 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:12:59,167 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:12:59,167 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:12:59,167 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:12:59,168 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:12:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-21 18:12:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-21 18:12:59,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:59,201 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] [2018-09-21 18:12:59,204 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1700649700, now seen corresponding path program 1 times [2018-09-21 18:12:59,216 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:12:59,217 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) [2018-09-21 18:12:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-21 18:12:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:59,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:12:59,389 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-21 18:12:59,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:12:59,413 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:59,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:12:59,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:12:59,436 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:12:59,437 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:12:59,440 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-21 18:12:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:59,469 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-09-21 18:12:59,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:12:59,471 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-21 18:12:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:59,483 INFO L225 Difference]: With dead ends: 51 [2018-09-21 18:12:59,484 INFO L226 Difference]: Without dead ends: 46 [2018-09-21 18:12:59,487 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-21 18:12:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-21 18:12:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-21 18:12:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:12:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-21 18:12:59,535 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-21 18:12:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:59,536 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-21 18:12:59,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:12:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-21 18:12:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-21 18:12:59,539 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:59,539 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] [2018-09-21 18:12:59,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1378721572, now seen corresponding path program 1 times [2018-09-21 18:12:59,541 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:12:59,541 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-21 18:12:59,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:12:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:12:59,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:12:59,754 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-21 18:12:59,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:12:59,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:12:59,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:12:59,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:12:59,773 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:12:59,773 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:59,774 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-21 18:12:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:12:59,884 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-09-21 18:12:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:12:59,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-21 18:12:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:12:59,890 INFO L225 Difference]: With dead ends: 49 [2018-09-21 18:12:59,890 INFO L226 Difference]: Without dead ends: 49 [2018-09-21 18:12:59,891 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:12:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-21 18:12:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-21 18:12:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:12:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-21 18:12:59,904 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-21 18:12:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:12:59,905 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-21 18:12:59,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:12:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-21 18:12:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-21 18:12:59,907 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:12:59,908 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] [2018-09-21 18:12:59,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:12:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1304320947, now seen corresponding path program 1 times [2018-09-21 18:12:59,909 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:12:59,909 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-21 18:12:59,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:00,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:00,081 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-21 18:13:00,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:00,096 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:00,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:00,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:00,097 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:00,097 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,097 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-21 18:13:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:00,203 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-09-21 18:13:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:00,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-21 18:13:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:00,207 INFO L225 Difference]: With dead ends: 52 [2018-09-21 18:13:00,207 INFO L226 Difference]: Without dead ends: 52 [2018-09-21 18:13:00,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-21 18:13:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-21 18:13:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:13:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-21 18:13:00,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-21 18:13:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:00,218 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-21 18:13:00,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-21 18:13:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-21 18:13:00,220 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:00,220 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] [2018-09-21 18:13:00,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:00,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1932752128, now seen corresponding path program 1 times [2018-09-21 18:13:00,222 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:00,222 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-21 18:13:00,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:00,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:00,349 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-21 18:13:00,349 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:00,363 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:00,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:00,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:00,364 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:00,364 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,365 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-21 18:13:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:00,449 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-09-21 18:13:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:00,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-21 18:13:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:00,453 INFO L225 Difference]: With dead ends: 52 [2018-09-21 18:13:00,453 INFO L226 Difference]: Without dead ends: 52 [2018-09-21 18:13:00,453 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-21 18:13:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-21 18:13:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:13:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-21 18:13:00,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-21 18:13:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:00,462 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-21 18:13:00,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-21 18:13:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-21 18:13:00,464 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:00,464 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] [2018-09-21 18:13:00,464 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1420834481, now seen corresponding path program 1 times [2018-09-21 18:13:00,465 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:00,465 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) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:00,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:00,688 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-21 18:13:00,689 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:00,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:00,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:00,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:00,708 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:00,708 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,708 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-21 18:13:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:00,846 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-09-21 18:13:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:00,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-21 18:13:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:00,849 INFO L225 Difference]: With dead ends: 52 [2018-09-21 18:13:00,849 INFO L226 Difference]: Without dead ends: 52 [2018-09-21 18:13:00,850 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-21 18:13:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-21 18:13:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:13:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-21 18:13:00,858 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-21 18:13:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:00,858 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-21 18:13:00,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-21 18:13:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-21 18:13:00,861 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:00,861 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] [2018-09-21 18:13:00,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:00,862 INFO L82 PathProgramCache]: Analyzing trace with hash -386619982, now seen corresponding path program 1 times [2018-09-21 18:13:00,862 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:00,863 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-21 18:13:00,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:00,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:01,370 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-21 18:13:01,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:01,386 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:01,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:13:01,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:13:01,387 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:13:01,387 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:13:01,389 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-09-21 18:13:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:03,591 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-09-21 18:13:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-21 18:13:03,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-21 18:13:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:03,595 INFO L225 Difference]: With dead ends: 53 [2018-09-21 18:13:03,595 INFO L226 Difference]: Without dead ends: 49 [2018-09-21 18:13:03,596 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:13:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-21 18:13:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-21 18:13:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-09-21 18:13:03,602 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-09-21 18:13:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:03,603 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-09-21 18:13:03,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:13:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-09-21 18:13:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-21 18:13:03,607 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:03,608 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:03,608 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1132927488, now seen corresponding path program 1 times [2018-09-21 18:13:03,609 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:03,609 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) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:03,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-21 18:13:03,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:03,801 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:03,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:03,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:03,803 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:03,805 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:03,805 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-09-21 18:13:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:03,877 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-09-21 18:13:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:03,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-21 18:13:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:03,879 INFO L225 Difference]: With dead ends: 49 [2018-09-21 18:13:03,879 INFO L226 Difference]: Without dead ends: 49 [2018-09-21 18:13:03,880 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-21 18:13:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-21 18:13:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:13:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-21 18:13:03,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 58 [2018-09-21 18:13:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:03,887 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-21 18:13:03,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-21 18:13:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-21 18:13:03,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:03,888 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:03,889 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash 310309699, now seen corresponding path program 1 times [2018-09-21 18:13:03,889 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:03,890 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) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:03,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:04,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-21 18:13:04,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:04,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:04,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:04,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:04,159 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:04,159 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:04,159 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-21 18:13:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:04,204 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-09-21 18:13:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:04,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-21 18:13:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:04,207 INFO L225 Difference]: With dead ends: 52 [2018-09-21 18:13:04,207 INFO L226 Difference]: Without dead ends: 52 [2018-09-21 18:13:04,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-21 18:13:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-21 18:13:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-21 18:13:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-21 18:13:04,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 59 [2018-09-21 18:13:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:04,214 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-21 18:13:04,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-21 18:13:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-21 18:13:04,215 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:04,216 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:04,216 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1101257373, now seen corresponding path program 1 times [2018-09-21 18:13:04,218 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:04,218 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-21 18:13:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:04,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:04,437 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-21 18:13:04,453 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-21 18:13:04,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:04,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:04,477 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-21 18:13:04,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:13:04,549 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-21 18:13:04,556 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-21 18:13:04,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:04,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:04,574 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-21 18:13:04,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:13:05,449 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:13:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:05,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:05,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:05,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-21 18:13:05,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-21 18:13:05,673 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-21 18:13:05,673 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-21 18:13:05,673 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 13 states. [2018-09-21 18:13:06,999 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:13:08,015 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-21 18:13:08,297 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-21 18:13:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:08,488 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-09-21 18:13:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:13:08,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-09-21 18:13:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:08,491 INFO L225 Difference]: With dead ends: 61 [2018-09-21 18:13:08,491 INFO L226 Difference]: Without dead ends: 56 [2018-09-21 18:13:08,492 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:13:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-21 18:13:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-21 18:13:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-21 18:13:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-21 18:13:08,499 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 60 [2018-09-21 18:13:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:08,500 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-21 18:13:08,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-21 18:13:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-21 18:13:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-21 18:13:08,501 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:08,501 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:08,502 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -673749989, now seen corresponding path program 1 times [2018-09-21 18:13:08,503 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:08,503 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-21 18:13:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:08,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-21 18:13:08,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:08,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:08,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-21 18:13:08,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-21 18:13:08,857 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-21 18:13:08,857 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-21 18:13:08,857 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-09-21 18:13:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:09,269 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-09-21 18:13:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-21 18:13:09,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-21 18:13:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:09,272 INFO L225 Difference]: With dead ends: 56 [2018-09-21 18:13:09,272 INFO L226 Difference]: Without dead ends: 51 [2018-09-21 18:13:09,272 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-21 18:13:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-21 18:13:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-21 18:13:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-21 18:13:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-21 18:13:09,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-21 18:13:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:09,278 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-21 18:13:09,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-21 18:13:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-21 18:13:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-21 18:13:09,279 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:09,279 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:09,280 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -833861020, now seen corresponding path program 1 times [2018-09-21 18:13:09,280 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:09,280 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) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:09,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:09,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-21 18:13:09,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:09,420 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:09,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:09,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:09,421 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:09,421 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:09,423 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-09-21 18:13:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:09,528 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-09-21 18:13:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:09,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-21 18:13:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:09,530 INFO L225 Difference]: With dead ends: 54 [2018-09-21 18:13:09,530 INFO L226 Difference]: Without dead ends: 54 [2018-09-21 18:13:09,531 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-21 18:13:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-21 18:13:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-21 18:13:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-21 18:13:09,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-21 18:13:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:09,537 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-21 18:13:09,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-21 18:13:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-21 18:13:09,538 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:09,538 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:09,539 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 777757472, now seen corresponding path program 1 times [2018-09-21 18:13:09,539 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:09,539 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) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:09,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:09,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-21 18:13:09,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:09,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:09,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:13:09,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:13:09,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:13:09,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:13:09,998 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-21 18:13:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:10,789 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-09-21 18:13:10,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:13:10,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-21 18:13:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:10,791 INFO L225 Difference]: With dead ends: 55 [2018-09-21 18:13:10,791 INFO L226 Difference]: Without dead ends: 48 [2018-09-21 18:13:10,792 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:13:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-21 18:13:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-21 18:13:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-21 18:13:10,797 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-21 18:13:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:10,797 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-21 18:13:10,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:13:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-21 18:13:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-21 18:13:10,798 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:10,798 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:10,799 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash -583298201, now seen corresponding path program 1 times [2018-09-21 18:13:10,799 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:10,799 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) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:10,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:10,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-21 18:13:10,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:13:10,978 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:13:10,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:13:10,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:13:10,978 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:13:10,978 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:10,979 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-09-21 18:13:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:10,991 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-09-21 18:13:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:13:10,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-21 18:13:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:10,992 INFO L225 Difference]: With dead ends: 49 [2018-09-21 18:13:10,992 INFO L226 Difference]: Without dead ends: 48 [2018-09-21 18:13:10,993 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:13:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-21 18:13:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-21 18:13:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-21 18:13:10,996 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-21 18:13:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:10,996 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-21 18:13:10,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:13:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-21 18:13:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-21 18:13:10,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:10,998 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:10,998 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1904214632, now seen corresponding path program 1 times [2018-09-21 18:13:10,998 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:10,998 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) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:11,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:11,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:11,145 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-21 18:13:11,151 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-21 18:13:11,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:11,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:11,178 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-21 18:13:11,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:13:11,222 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-21 18:13:11,229 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-21 18:13:11,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:11,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:11,244 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-21 18:13:11,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:13:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:11,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:12,833 WARN L178 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-21 18:13:13,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-21 18:13:13,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-21 18:13:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:13,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:13,171 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:13,172 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:13,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 27 treesize of output 35 [2018-09-21 18:13:13,216 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:13,233 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-21 18:13:13,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:13,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:13,287 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-21 18:13:13,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:13:13,488 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 28 treesize of output 22 [2018-09-21 18:13:13,504 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:13,508 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 22 treesize of output 11 [2018-09-21 18:13:13,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:13,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:13,529 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-21 18:13:13,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-21 18:13:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:13,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:13,804 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-21 18:13:14,010 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:13:14,113 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:13:14,331 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:13:14,588 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:14,591 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:14,593 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-21 18:13:14,601 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:14,617 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 39 treesize of output 26 [2018-09-21 18:13:14,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,651 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 21 treesize of output 17 [2018-09-21 18:13:14,672 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:14,676 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 17 treesize of output 5 [2018-09-21 18:13:14,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,811 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:14,815 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:14,816 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-21 18:13:14,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:14,863 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 39 treesize of output 26 [2018-09-21 18:13:14,864 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,906 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 21 treesize of output 17 [2018-09-21 18:13:14,913 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:14,917 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 17 treesize of output 5 [2018-09-21 18:13:14,917 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:14,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-21 18:13:14,971 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:33 [2018-09-21 18:13:15,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-21 18:13:15,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-21 18:13:15,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:13:15,071 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:13:15,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:13:15,071 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-09-21 18:13:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:16,939 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-21 18:13:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:13:16,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-09-21 18:13:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:16,942 INFO L225 Difference]: With dead ends: 53 [2018-09-21 18:13:16,942 INFO L226 Difference]: Without dead ends: 46 [2018-09-21 18:13:16,943 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:13:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-21 18:13:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-21 18:13:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-09-21 18:13:16,947 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 61 [2018-09-21 18:13:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:16,947 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-09-21 18:13:16,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:13:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-09-21 18:13:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-21 18:13:16,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:16,951 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:16,951 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2059046953, now seen corresponding path program 1 times [2018-09-21 18:13:16,953 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:16,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:17,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:17,121 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-21 18:13:17,127 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-21 18:13:17,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:17,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:17,180 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-21 18:13:17,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:13:17,224 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-21 18:13:17,228 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-21 18:13:17,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:17,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:17,240 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-21 18:13:17,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:13:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:17,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:17,686 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:13:18,180 WARN L178 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-21 18:13:18,361 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-21 18:13:18,519 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:13:18,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-21 18:13:18,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-21 18:13:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:18,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:18,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:18,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:18,864 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-21 18:13:18,874 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:18,896 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-21 18:13:18,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:18,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:18,933 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-21 18:13:18,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:13:19,045 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 28 treesize of output 22 [2018-09-21 18:13:19,050 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:19,054 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 22 treesize of output 11 [2018-09-21 18:13:19,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:19,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:19,072 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-21 18:13:19,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-21 18:13:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:19,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:19,374 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-21 18:13:19,828 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-21 18:13:20,011 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:13:20,119 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:13:20,367 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:13:20,385 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:20,389 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:20,390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-09-21 18:13:20,397 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:20,416 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 39 treesize of output 26 [2018-09-21 18:13:20,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,467 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 21 treesize of output 17 [2018-09-21 18:13:20,501 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:20,527 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 17 treesize of output 5 [2018-09-21 18:13:20,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,654 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:20,659 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:20,660 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-21 18:13:20,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:20,709 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 39 treesize of output 26 [2018-09-21 18:13:20,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,754 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 21 treesize of output 17 [2018-09-21 18:13:20,760 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:20,763 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 17 treesize of output 5 [2018-09-21 18:13:20,764 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,769 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:20,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-21 18:13:20,833 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:101, output treesize:43 [2018-09-21 18:13:20,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-21 18:13:20,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-21 18:13:20,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:13:20,944 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:13:20,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:13:20,945 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-09-21 18:13:22,555 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-21 18:13:23,200 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:13:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:24,273 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-09-21 18:13:24,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:13:24,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-09-21 18:13:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:24,276 INFO L225 Difference]: With dead ends: 53 [2018-09-21 18:13:24,276 INFO L226 Difference]: Without dead ends: 46 [2018-09-21 18:13:24,277 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:13:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-21 18:13:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-21 18:13:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-21 18:13:24,282 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 62 [2018-09-21 18:13:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:24,282 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-21 18:13:24,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:13:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-21 18:13:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-21 18:13:24,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:24,283 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:24,284 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 183414724, now seen corresponding path program 1 times [2018-09-21 18:13:24,284 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:24,284 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:24,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:24,420 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-21 18:13:24,426 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-21 18:13:24,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:24,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:24,448 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-21 18:13:24,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:13:24,488 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-21 18:13:24,493 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-21 18:13:24,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:24,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:24,507 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-21 18:13:24,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:13:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:24,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:24,898 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-21 18:13:25,078 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-09-21 18:13:25,412 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-21 18:13:25,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-21 18:13:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:25,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:25,479 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:25,481 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:25,482 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-21 18:13:25,510 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:25,528 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-21 18:13:25,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:25,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:25,586 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-21 18:13:25,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:13:25,673 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 28 treesize of output 22 [2018-09-21 18:13:25,681 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:25,686 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 22 treesize of output 11 [2018-09-21 18:13:25,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:25,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:25,706 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-21 18:13:25,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-21 18:13:26,132 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-21 18:13:26,484 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:13:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:26,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:26,981 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-09-21 18:13:27,264 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-21 18:13:27,366 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:13:29,086 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:13:29,346 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:13:29,528 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:13:29,555 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:29,558 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:29,560 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-21 18:13:29,566 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:29,587 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 39 treesize of output 26 [2018-09-21 18:13:29,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,630 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 21 treesize of output 17 [2018-09-21 18:13:29,665 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:29,685 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 17 treesize of output 5 [2018-09-21 18:13:29,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,786 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:29,790 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:29,791 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-21 18:13:29,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:29,812 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 39 treesize of output 26 [2018-09-21 18:13:29,812 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,848 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 21 treesize of output 17 [2018-09-21 18:13:29,858 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:29,863 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 17 treesize of output 5 [2018-09-21 18:13:29,864 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,867 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,875 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:29,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-21 18:13:29,904 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:38 [2018-09-21 18:13:30,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-21 18:13:30,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-09-21 18:13:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-21 18:13:30,005 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-21 18:13:30,005 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-21 18:13:30,006 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-09-21 18:13:33,699 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:13:33,991 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-21 18:13:34,809 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-21 18:13:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:13:34,942 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-09-21 18:13:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:13:34,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-21 18:13:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:13:34,945 INFO L225 Difference]: With dead ends: 53 [2018-09-21 18:13:34,945 INFO L226 Difference]: Without dead ends: 46 [2018-09-21 18:13:34,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:13:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-21 18:13:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-21 18:13:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-21 18:13:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-21 18:13:34,953 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 63 [2018-09-21 18:13:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:13:34,953 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-21 18:13:34,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-21 18:13:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-21 18:13:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-21 18:13:34,959 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:13:34,959 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:13:34,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:13:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1529769203, now seen corresponding path program 1 times [2018-09-21 18:13:34,960 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:13:34,960 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-21 18:13:34,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:13:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:13:35,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:13:35,123 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:35,125 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:35,126 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-21 18:13:35,133 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:35,151 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-21 18:13:35,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,184 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-21 18:13:35,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:13:35,354 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:35,355 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:35,356 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-21 18:13:35,365 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:35,382 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-21 18:13:35,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,446 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-21 18:13:35,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:13:35,521 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-21 18:13:35,526 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:35,531 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-21 18:13:35,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:13:35,556 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-21 18:13:35,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:13:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:13:36,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:13:36,848 WARN L178 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:13:37,023 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:13:37,347 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:13:38,150 WARN L178 SmtUtils]: Spent 801.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:13:38,370 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:13:38,562 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-21 18:13:38,687 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-21 18:13:38,859 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-21 18:13:38,873 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:38,875 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:38,878 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:38,880 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:38,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 132 [2018-09-21 18:13:39,007 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-21 18:13:39,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:39,052 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:39,067 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:13:39,073 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:39,075 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:13:39,278 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-21 18:13:39,279 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_30 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) 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.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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) [2018-09-21 18:13:39,283 INFO L168 Benchmark]: Toolchain (without parser) took 41381.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 951.8 MB in the beginning and 839.6 MB in the end (delta: 112.3 MB). Peak memory consumption was 431.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:13:39,284 INFO L168 Benchmark]: CDTParser took 0.23 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-21 18:13:39,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:13:39,285 INFO L168 Benchmark]: Boogie Preprocessor took 70.28 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:13:39,285 INFO L168 Benchmark]: RCFGBuilder took 732.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:13:39,286 INFO L168 Benchmark]: TraceAbstraction took 40194.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 839.6 MB in the end (delta: 273.0 MB). Peak memory consumption was 446.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:13:39,288 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.23 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 375.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.28 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 732.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40194.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 839.6 MB in the end (delta: 273.0 MB). Peak memory consumption was 446.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_30 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...