./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer --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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:40:20,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:40:20,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:40:20,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:40:20,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:40:20,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:40:20,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:40:20,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:40:20,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:40:20,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:40:20,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:40:20,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:40:20,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:40:20,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:40:20,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:40:20,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:40:20,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:40:20,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:40:20,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:40:20,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:40:20,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:40:20,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:40:20,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:40:20,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:40:20,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:40:20,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:40:20,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:40:20,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:40:20,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:40:20,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:40:20,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:40:20,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:40:20,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:40:20,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:40:20,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:40:20,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:40:20,580 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 21:40:20,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:40:20,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:40:20,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:40:20,588 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:40:20,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:40:20,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:40:20,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:40:20,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:40:20,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:40:20,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:40:20,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:40:20,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:40:20,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:40:20,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:40:20,592 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-12-02 21:40:20,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:40:20,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:40:20,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:40:20,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:40:20,626 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:40:20,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-02 21:40:20,662 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/data/3b1683d3a/b44fcf44755041c893bb664c2e1d2a6f/FLAG9e2199fcf [2018-12-02 21:40:21,125 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:40:21,125 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-02 21:40:21,131 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/data/3b1683d3a/b44fcf44755041c893bb664c2e1d2a6f/FLAG9e2199fcf [2018-12-02 21:40:21,140 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/data/3b1683d3a/b44fcf44755041c893bb664c2e1d2a6f [2018-12-02 21:40:21,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:40:21,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:40:21,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:40:21,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:40:21,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:40:21,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21, skipping insertion in model container [2018-12-02 21:40:21,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:40:21,180 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:40:21,340 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:40:21,345 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:40:21,409 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:40:21,429 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:40:21,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21 WrapperNode [2018-12-02 21:40:21,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:40:21,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:40:21,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:40:21,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:40:21,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:40:21,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:40:21,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:40:21,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:40:21,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... [2018-12-02 21:40:21,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:40:21,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:40:21,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:40:21,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:40:21,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/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-12-02 21:40:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:40:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:40:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:40:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:40:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:40:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:40:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:40:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:40:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:40:21,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:40:21,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:40:21,754 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-02 21:40:21,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:40:21 BoogieIcfgContainer [2018-12-02 21:40:21,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:40:21,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:40:21,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:40:21,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:40:21,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:40:21" (1/3) ... [2018-12-02 21:40:21,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3816431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:40:21, skipping insertion in model container [2018-12-02 21:40:21,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:40:21" (2/3) ... [2018-12-02 21:40:21,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3816431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:40:21, skipping insertion in model container [2018-12-02 21:40:21,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:40:21" (3/3) ... [2018-12-02 21:40:21,759 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-12-02 21:40:21,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:40:21,770 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-02 21:40:21,779 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-02 21:40:21,797 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:40:21,798 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:40:21,798 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:40:21,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:40:21,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:40:21,798 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:40:21,798 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:40:21,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:40:21,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:40:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-12-02 21:40:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 21:40:21,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:21,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:21,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:21,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash 11196085, now seen corresponding path program 1 times [2018-12-02 21:40:21,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:21,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:21,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:21,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:21,916 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-12-02 21:40:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:21,950 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2018-12-02 21:40:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:21,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-02 21:40:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:21,957 INFO L225 Difference]: With dead ends: 188 [2018-12-02 21:40:21,957 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 21:40:21,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 21:40:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-12-02 21:40:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 21:40:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-02 21:40:21,982 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2018-12-02 21:40:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:21,983 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-02 21:40:21,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-02 21:40:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:40:21,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:21,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:21,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:21,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1909121887, now seen corresponding path program 1 times [2018-12-02 21:40:21,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:21,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:22,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,015 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2018-12-02 21:40:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,025 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-02 21:40:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:22,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 21:40:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,026 INFO L225 Difference]: With dead ends: 85 [2018-12-02 21:40:22,026 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 21:40:22,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 21:40:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 21:40:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 21:40:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-12-02 21:40:22,032 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-12-02 21:40:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,032 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-12-02 21:40:22,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-12-02 21:40:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:40:22,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:22,033 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123809, now seen corresponding path program 1 times [2018-12-02 21:40:22,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:40:22,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:40:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:40:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,067 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-12-02 21:40:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,105 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-12-02 21:40:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:40:22,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 21:40:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,106 INFO L225 Difference]: With dead ends: 84 [2018-12-02 21:40:22,106 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 21:40:22,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 21:40:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-02 21:40:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 21:40:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-12-02 21:40:22,111 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2018-12-02 21:40:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,111 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-12-02 21:40:22,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:40:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-12-02 21:40:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:40:22,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:22,112 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash -44725957, now seen corresponding path program 1 times [2018-12-02 21:40:22,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:22,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,136 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-12-02 21:40:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,171 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-12-02 21:40:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:22,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 21:40:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,172 INFO L225 Difference]: With dead ends: 83 [2018-12-02 21:40:22,172 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 21:40:22,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 21:40:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-02 21:40:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 21:40:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-02 21:40:22,176 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2018-12-02 21:40:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,177 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-02 21:40:22,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-02 21:40:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:40:22,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:22,178 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1386500464, now seen corresponding path program 1 times [2018-12-02 21:40:22,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:40:22,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:40:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:40:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,203 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2018-12-02 21:40:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,252 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2018-12-02 21:40:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:40:22,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 21:40:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,253 INFO L225 Difference]: With dead ends: 136 [2018-12-02 21:40:22,253 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:40:22,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:40:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:40:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-12-02 21:40:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 21:40:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-12-02 21:40:22,257 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2018-12-02 21:40:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,257 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-12-02 21:40:22,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:40:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-12-02 21:40:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:40:22,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,258 INFO L402 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] [2018-12-02 21:40:22,258 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 725856891, now seen corresponding path program 1 times [2018-12-02 21:40:22,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:22,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:22,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,280 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2018-12-02 21:40:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,291 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-12-02 21:40:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:22,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 21:40:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,292 INFO L225 Difference]: With dead ends: 141 [2018-12-02 21:40:22,292 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 21:40:22,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 21:40:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-12-02 21:40:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 21:40:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-02 21:40:22,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2018-12-02 21:40:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,297 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-02 21:40:22,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-02 21:40:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 21:40:22,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,298 INFO L402 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-12-02 21:40:22,298 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1026716690, now seen corresponding path program 1 times [2018-12-02 21:40:22,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:22,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,318 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2018-12-02 21:40:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,327 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-02 21:40:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:22,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 21:40:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,328 INFO L225 Difference]: With dead ends: 78 [2018-12-02 21:40:22,328 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 21:40:22,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 21:40:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-02 21:40:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 21:40:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-02 21:40:22,332 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2018-12-02 21:40:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,332 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-02 21:40:22,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-02 21:40:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:40:22,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,333 INFO L402 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-12-02 21:40:22,334 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1611661129, now seen corresponding path program 1 times [2018-12-02 21:40:22,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:22,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:22,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:22,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,352 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-12-02 21:40:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,361 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-02 21:40:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:22,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 21:40:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,362 INFO L225 Difference]: With dead ends: 79 [2018-12-02 21:40:22,362 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 21:40:22,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 21:40:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 21:40:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 21:40:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-12-02 21:40:22,366 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2018-12-02 21:40:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,366 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-12-02 21:40:22,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-12-02 21:40:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:40:22,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,367 INFO L402 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-12-02 21:40:22,367 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1611663051, now seen corresponding path program 1 times [2018-12-02 21:40:22,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:40:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:40:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:40:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,403 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 4 states. [2018-12-02 21:40:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,445 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-02 21:40:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:40:22,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 21:40:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,446 INFO L225 Difference]: With dead ends: 78 [2018-12-02 21:40:22,446 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 21:40:22,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 21:40:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-02 21:40:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 21:40:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-12-02 21:40:22,451 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2018-12-02 21:40:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,451 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-12-02 21:40:22,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:40:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-12-02 21:40:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:40:22,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,452 INFO L402 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] [2018-12-02 21:40:22,453 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1836072976, now seen corresponding path program 1 times [2018-12-02 21:40:22,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:40:22,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:40:22,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:40:22,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:22,493 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-12-02 21:40:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,554 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-12-02 21:40:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:40:22,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-02 21:40:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,555 INFO L225 Difference]: With dead ends: 190 [2018-12-02 21:40:22,555 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 21:40:22,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:40:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 21:40:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-12-02 21:40:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 21:40:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-02 21:40:22,560 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2018-12-02 21:40:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,560 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-02 21:40:22,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:40:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-02 21:40:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:40:22,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,561 INFO L402 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] [2018-12-02 21:40:22,562 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash 870546418, now seen corresponding path program 1 times [2018-12-02 21:40:22,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:40:22,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:40:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:40:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:40:22,621 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-12-02 21:40:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:22,744 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-12-02 21:40:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:40:22,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 21:40:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:22,744 INFO L225 Difference]: With dead ends: 182 [2018-12-02 21:40:22,744 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 21:40:22,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:40:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 21:40:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2018-12-02 21:40:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 21:40:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-02 21:40:22,749 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2018-12-02 21:40:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:22,750 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-02 21:40:22,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:40:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-02 21:40:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:40:22,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:22,750 INFO L402 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] [2018-12-02 21:40:22,751 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:22,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:22,751 INFO L82 PathProgramCache]: Analyzing trace with hash 769950578, now seen corresponding path program 1 times [2018-12-02 21:40:22,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:22,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:22,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:22,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:22,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:40:22,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:40:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:40:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:40:22,927 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-02 21:40:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:23,235 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-12-02 21:40:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:40:23,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 21:40:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:23,237 INFO L225 Difference]: With dead ends: 241 [2018-12-02 21:40:23,237 INFO L226 Difference]: Without dead ends: 239 [2018-12-02 21:40:23,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:40:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-02 21:40:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2018-12-02 21:40:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 21:40:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-02 21:40:23,243 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2018-12-02 21:40:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:23,243 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-02 21:40:23,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:40:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-02 21:40:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:40:23,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:23,243 INFO L402 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] [2018-12-02 21:40:23,244 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:23,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1506132002, now seen corresponding path program 1 times [2018-12-02 21:40:23,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:23,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:40:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:40:23,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:40:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:40:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:40:23,270 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-12-02 21:40:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:23,330 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-12-02 21:40:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:40:23,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-02 21:40:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:23,331 INFO L225 Difference]: With dead ends: 145 [2018-12-02 21:40:23,331 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 21:40:23,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:40:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 21:40:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-12-02 21:40:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 21:40:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-12-02 21:40:23,336 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2018-12-02 21:40:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:23,336 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-12-02 21:40:23,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:40:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-12-02 21:40:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:40:23,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:23,337 INFO L402 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] [2018-12-02 21:40:23,338 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:23,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -677189726, now seen corresponding path program 1 times [2018-12-02 21:40:23,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:40:23,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:23,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:23,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:23,352 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2018-12-02 21:40:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:23,373 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-12-02 21:40:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:23,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 21:40:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:23,375 INFO L225 Difference]: With dead ends: 119 [2018-12-02 21:40:23,375 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 21:40:23,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 21:40:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-02 21:40:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-02 21:40:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2018-12-02 21:40:23,380 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2018-12-02 21:40:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:23,380 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2018-12-02 21:40:23,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2018-12-02 21:40:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 21:40:23,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:23,381 INFO L402 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] [2018-12-02 21:40:23,381 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:23,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1818543518, now seen corresponding path program 1 times [2018-12-02 21:40:23,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:23,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:23,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:40:23,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:40:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:40:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:40:23,511 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 7 states. [2018-12-02 21:40:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:23,735 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-12-02 21:40:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:40:23,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-02 21:40:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:23,736 INFO L225 Difference]: With dead ends: 277 [2018-12-02 21:40:23,736 INFO L226 Difference]: Without dead ends: 275 [2018-12-02 21:40:23,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:40:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-02 21:40:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2018-12-02 21:40:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 21:40:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-12-02 21:40:23,742 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2018-12-02 21:40:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:23,742 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-12-02 21:40:23,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:40:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-12-02 21:40:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 21:40:23,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:23,742 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-02 21:40:23,743 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:23,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash -828341282, now seen corresponding path program 1 times [2018-12-02 21:40:23,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:23,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:40:23,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:40:23,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:23,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:40:23,838 INFO L478 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 11 treesize of output 8 [2018-12-02 21:40:23,840 INFO L478 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 8 treesize of output 7 [2018-12-02 21:40:23,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,855 INFO L478 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 11 treesize of output 8 [2018-12-02 21:40:23,857 INFO L478 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 8 treesize of output 7 [2018-12-02 21:40:23,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-02 21:40:23,883 INFO L478 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 21 treesize of output 16 [2018-12-02 21:40:23,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:23,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:40:23,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,899 INFO L478 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 21 treesize of output 16 [2018-12-02 21:40:23,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:23,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:40:23,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-02 21:40:23,947 INFO L478 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 22 treesize of output 16 [2018-12-02 21:40:23,948 INFO L478 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 16 treesize of output 3 [2018-12-02 21:40:23,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,954 INFO L478 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 22 treesize of output 16 [2018-12-02 21:40:23,956 INFO L478 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 16 treesize of output 3 [2018-12-02 21:40:23,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:23,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-12-02 21:40:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:23,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:40:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-12-02 21:40:23,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:40:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:40:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:40:23,979 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2018-12-02 21:40:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:24,144 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2018-12-02 21:40:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:40:24,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-02 21:40:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:24,145 INFO L225 Difference]: With dead ends: 224 [2018-12-02 21:40:24,145 INFO L226 Difference]: Without dead ends: 162 [2018-12-02 21:40:24,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:40:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-02 21:40:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2018-12-02 21:40:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 21:40:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-12-02 21:40:24,154 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-12-02 21:40:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:24,154 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-12-02 21:40:24,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:40:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-12-02 21:40:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 21:40:24,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:24,155 INFO L402 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] [2018-12-02 21:40:24,155 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:24,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -693545280, now seen corresponding path program 1 times [2018-12-02 21:40:24,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:24,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:24,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:40:24,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:40:24,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:40:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:40:24,259 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-12-02 21:40:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:24,362 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-12-02 21:40:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:40:24,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-02 21:40:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:24,362 INFO L225 Difference]: With dead ends: 165 [2018-12-02 21:40:24,363 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 21:40:24,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:40:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 21:40:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-12-02 21:40:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 21:40:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-12-02 21:40:24,368 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2018-12-02 21:40:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:24,368 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-12-02 21:40:24,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:40:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-12-02 21:40:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:40:24,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:24,368 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-02 21:40:24,369 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:24,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:24,369 INFO L82 PathProgramCache]: Analyzing trace with hash 928343854, now seen corresponding path program 1 times [2018-12-02 21:40:24,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:24,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:40:24,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:40:24,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:24,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:40:24,451 INFO L478 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 13 treesize of output 10 [2018-12-02 21:40:24,453 INFO L478 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 10 treesize of output 9 [2018-12-02 21:40:24,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 21:40:24,489 INFO L478 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 15 treesize of output 11 [2018-12-02 21:40:24,491 INFO L478 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 11 treesize of output 3 [2018-12-02 21:40:24,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,497 INFO L478 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 24 treesize of output 18 [2018-12-02 21:40:24,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:24,500 INFO L478 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 18 treesize of output 10 [2018-12-02 21:40:24,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:24,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-12-02 21:40:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:24,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:40:24,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-12-02 21:40:24,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:40:24,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:40:24,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:40:24,522 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2018-12-02 21:40:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:24,711 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-12-02 21:40:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:40:24,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-02 21:40:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:24,712 INFO L225 Difference]: With dead ends: 225 [2018-12-02 21:40:24,712 INFO L226 Difference]: Without dead ends: 194 [2018-12-02 21:40:24,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:40:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-02 21:40:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2018-12-02 21:40:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 21:40:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-12-02 21:40:24,721 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2018-12-02 21:40:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:24,721 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-12-02 21:40:24,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:40:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-12-02 21:40:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:40:24,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:24,722 INFO L402 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] [2018-12-02 21:40:24,722 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:24,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:24,722 INFO L82 PathProgramCache]: Analyzing trace with hash 36989377, now seen corresponding path program 1 times [2018-12-02 21:40:24,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:24,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:24,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:24,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:24,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:40:24,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:40:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:40:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:24,740 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2018-12-02 21:40:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:24,760 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2018-12-02 21:40:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:40:24,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 21:40:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:24,761 INFO L225 Difference]: With dead ends: 297 [2018-12-02 21:40:24,761 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 21:40:24,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:40:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 21:40:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2018-12-02 21:40:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 21:40:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2018-12-02 21:40:24,768 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2018-12-02 21:40:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:24,769 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2018-12-02 21:40:24,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:40:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2018-12-02 21:40:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:40:24,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:24,769 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:24,770 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:24,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1278661403, now seen corresponding path program 1 times [2018-12-02 21:40:24,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:24,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:40:24,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:40:24,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:40:24,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:40:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:40:24,796 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 4 states. [2018-12-02 21:40:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:24,846 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2018-12-02 21:40:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:40:24,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-02 21:40:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:24,847 INFO L225 Difference]: With dead ends: 291 [2018-12-02 21:40:24,847 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 21:40:24,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:40:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 21:40:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-12-02 21:40:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 21:40:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2018-12-02 21:40:24,858 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 40 [2018-12-02 21:40:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:24,858 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2018-12-02 21:40:24,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:40:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2018-12-02 21:40:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:40:24,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:24,859 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:24,859 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:24,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 257593049, now seen corresponding path program 1 times [2018-12-02 21:40:24,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:24,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:25,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:40:25,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:40:25,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:25,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:40:25,080 INFO L478 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 6 treesize of output 5 [2018-12-02 21:40:25,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:40:25,095 INFO L478 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 13 treesize of output 10 [2018-12-02 21:40:25,096 INFO L478 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 10 treesize of output 9 [2018-12-02 21:40:25,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,105 INFO L478 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 13 treesize of output 10 [2018-12-02 21:40:25,106 INFO L478 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 10 treesize of output 9 [2018-12-02 21:40:25,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-02 21:40:25,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:40:25,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-02 21:40:25,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:40:25,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 21:40:25,181 INFO L478 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 8 treesize of output 7 [2018-12-02 21:40:25,182 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-02 21:40:25,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:40:25,212 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-12-02 21:40:25,222 INFO L478 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 12 treesize of output 11 [2018-12-02 21:40:25,222 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,239 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-12-02 21:40:25,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-02 21:40:25,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-02 21:40:25,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-02 21:40:25,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-02 21:40:25,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:40:25,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-12-02 21:40:25,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2018-12-02 21:40:25,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,397 INFO L478 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 13 treesize of output 6 [2018-12-02 21:40:25,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-12-02 21:40:25,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:40:25,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:40:25,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-02 21:40:25,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:25,423 INFO L478 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 13 treesize of output 6 [2018-12-02 21:40:25,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,428 INFO L478 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 11 treesize of output 3 [2018-12-02 21:40:25,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,430 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:25,433 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-12-02 21:40:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:40:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-02 21:40:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:40:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:40:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2018-12-02 21:40:25,461 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 17 states. [2018-12-02 21:40:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:26,430 INFO L93 Difference]: Finished difference Result 479 states and 565 transitions. [2018-12-02 21:40:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 21:40:26,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-02 21:40:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:26,431 INFO L225 Difference]: With dead ends: 479 [2018-12-02 21:40:26,432 INFO L226 Difference]: Without dead ends: 387 [2018-12-02 21:40:26,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=736, Unknown=2, NotChecked=0, Total=992 [2018-12-02 21:40:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-02 21:40:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2018-12-02 21:40:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-02 21:40:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-12-02 21:40:26,443 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 40 [2018-12-02 21:40:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:26,443 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-12-02 21:40:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:40:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-12-02 21:40:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:40:26,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:26,444 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:40:26,444 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -427010471, now seen corresponding path program 1 times [2018-12-02 21:40:26,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:26,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:40:26,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:40:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:40:26,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:40:26,745 INFO L478 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 6 treesize of output 5 [2018-12-02 21:40:26,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:40:26,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:26,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:26,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:40:26,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 233 [2018-12-02 21:40:26,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:40:26,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 196 [2018-12-02 21:40:26,902 INFO L478 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 8 treesize of output 7 [2018-12-02 21:40:26,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 184 [2018-12-02 21:40:26,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:26,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 91 [2018-12-02 21:40:26,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:26,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 89 [2018-12-02 21:40:27,021 INFO L478 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 10 treesize of output 9 [2018-12-02 21:40:27,021 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-12-02 21:40:27,030 INFO L478 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 14 treesize of output 13 [2018-12-02 21:40:27,030 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-02 21:40:27,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-02 21:40:27,041 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,045 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,048 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,052 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,063 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2018-12-02 21:40:27,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 21:40:27,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2018-12-02 21:40:27,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 100 [2018-12-02 21:40:27,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 97 [2018-12-02 21:40:27,176 INFO L478 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 8 treesize of output 7 [2018-12-02 21:40:27,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-12-02 21:40:27,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:40:27,221 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 79 [2018-12-02 21:40:27,241 INFO L478 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 12 treesize of output 11 [2018-12-02 21:40:27,242 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,254 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,259 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,273 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:153, output treesize:114 [2018-12-02 21:40:27,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 149 [2018-12-02 21:40:27,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-12-02 21:40:27,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 92 [2018-12-02 21:40:27,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-02 21:40:27,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:130 [2018-12-02 21:40:27,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:40:27,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 121 [2018-12-02 21:40:27,483 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-12-02 21:40:27,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2018-12-02 21:40:27,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:40:27,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:40:27,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-02 21:40:27,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:40:27,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-02 21:40:27,549 INFO L478 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 20 treesize of output 5 [2018-12-02 21:40:27,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,555 INFO L478 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 16 treesize of output 3 [2018-12-02 21:40:27,555 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,557 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:40:27,561 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:149, output treesize:7 [2018-12-02 21:40:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:40:27,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:40:27,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-02 21:40:27,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:40:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:40:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2018-12-02 21:40:27,584 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 17 states. [2018-12-02 21:40:27,865 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-02 21:40:29,061 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-12-02 21:40:29,322 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2018-12-02 21:40:29,511 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 99 [2018-12-02 21:40:30,088 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-12-02 21:40:30,535 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-02 21:40:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:40:31,615 INFO L93 Difference]: Finished difference Result 778 states and 904 transitions. [2018-12-02 21:40:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 21:40:31,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-02 21:40:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:40:31,617 INFO L225 Difference]: With dead ends: 778 [2018-12-02 21:40:31,617 INFO L226 Difference]: Without dead ends: 776 [2018-12-02 21:40:31,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=555, Invalid=1700, Unknown=1, NotChecked=0, Total=2256 [2018-12-02 21:40:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-12-02 21:40:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 249. [2018-12-02 21:40:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 21:40:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2018-12-02 21:40:31,638 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 40 [2018-12-02 21:40:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:40:31,639 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2018-12-02 21:40:31,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:40:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2018-12-02 21:40:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:40:31,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:40:31,639 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-12-02 21:40:31,640 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:40:31,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:40:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1953426060, now seen corresponding path program 1 times [2018-12-02 21:40:31,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:40:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:40:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:31,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:40:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:40:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:40:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:40:31,671 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:40:31,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:40:31 BoogieIcfgContainer [2018-12-02 21:40:31,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:40:31,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:40:31,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:40:31,698 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:40:31,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:40:21" (3/4) ... [2018-12-02 21:40:31,700 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:40:31,727 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85629418-d0de-460a-9f58-e046f2fe7187/bin-2019/uautomizer/witness.graphml [2018-12-02 21:40:31,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:40:31,727 INFO L168 Benchmark]: Toolchain (without parser) took 10585.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 245.4 MB). Free memory was 950.6 MB in the beginning and 941.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,728 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:40:31,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.93 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,728 INFO L168 Benchmark]: Boogie Preprocessor took 22.63 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,729 INFO L168 Benchmark]: RCFGBuilder took 284.39 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: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,729 INFO L168 Benchmark]: TraceAbstraction took 9942.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 129.0 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,729 INFO L168 Benchmark]: Witness Printer took 29.11 ms. Allocated memory is still 1.3 GB. Free memory was 949.5 MB in the beginning and 941.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:40:31,730 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.93 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.63 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 284.39 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: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9942.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 129.0 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. * Witness Printer took 29.11 ms. Allocated memory is still 1.3 GB. Free memory was 949.5 MB in the beginning and 941.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 9.9s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 3581 SDslu, 4347 SDs, 0 SdLazy, 2521 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=22, 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 734 ConstructedInterpolants, 15 QuantifiedInterpolants, 411074 SizeOfPredicates, 45 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 10/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...