./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_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:26:55,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:26:55,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:26:55,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:26:55,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:26:55,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:26:55,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:26:55,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:26:55,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:26:55,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:26:55,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:26:55,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:26:55,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:26:55,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:26:55,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:26:55,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:26:55,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:26:55,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:26:55,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:26:55,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:26:55,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:26:55,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:26:55,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:26:55,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:26:55,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:26:55,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:26:55,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:26:55,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:26:55,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:26:55,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:26:55,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:26:55,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:26:55,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:26:55,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:26:55,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:26:55,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:26:55,906 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 13:26:55,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:26:55,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:26:55,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 13:26:55,914 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 13:26:55,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:26:55,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:26:55,914 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:26:55,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:26:55,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:26:55,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 13:26:55,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 13:26:55,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 13:26:55,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 13:26:55,916 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_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:26:55,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:26:55,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:26:55,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:26:55,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:26:55,943 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:26:55,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-08 13:26:55,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/data/333b3e41f/d56b909800994d38a13e3e56fe7218e8/FLAG7a06f4d14 [2018-12-08 13:26:56,456 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:26:56,456 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-08 13:26:56,462 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/data/333b3e41f/d56b909800994d38a13e3e56fe7218e8/FLAG7a06f4d14 [2018-12-08 13:26:56,470 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/data/333b3e41f/d56b909800994d38a13e3e56fe7218e8 [2018-12-08 13:26:56,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:26:56,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:26:56,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:26:56,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:26:56,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:26:56,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7453ceb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56, skipping insertion in model container [2018-12-08 13:26:56,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:26:56,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:26:56,666 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:26:56,671 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:26:56,738 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:26:56,767 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:26:56,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56 WrapperNode [2018-12-08 13:26:56,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:26:56,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:26:56,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:26:56,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:26:56,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:26:56,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:26:56,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:26:56,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:26:56,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... [2018-12-08 13:26:56,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:26:56,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:26:56,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:26:56,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:26:56,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:26:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 13:26:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 13:26:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 13:26:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 13:26:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 13:26:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 13:26:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 13:26:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 13:26:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:26:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:26:57,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:26:57,078 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-08 13:26:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:26:57 BoogieIcfgContainer [2018-12-08 13:26:57,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:26:57,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 13:26:57,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 13:26:57,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 13:26:57,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 01:26:56" (1/3) ... [2018-12-08 13:26:57,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31891424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:26:57, skipping insertion in model container [2018-12-08 13:26:57,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:26:56" (2/3) ... [2018-12-08 13:26:57,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31891424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:26:57, skipping insertion in model container [2018-12-08 13:26:57,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:26:57" (3/3) ... [2018-12-08 13:26:57,082 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-12-08 13:26:57,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 13:26:57,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-08 13:26:57,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-08 13:26:57,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:26:57,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 13:26:57,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 13:26:57,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 13:26:57,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:26:57,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:26:57,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 13:26:57,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:26:57,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 13:26:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-12-08 13:26:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 13:26:57,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:26:57,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 11196085, now seen corresponding path program 1 times [2018-12-08 13:26:57,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,227 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-08 13:26:57,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,240 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-12-08 13:26:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,274 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2018-12-08 13:26:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-08 13:26:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,281 INFO L225 Difference]: With dead ends: 188 [2018-12-08 13:26:57,281 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 13:26:57,283 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-08 13:26:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 13:26:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-12-08 13:26:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 13:26:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-08 13:26:57,306 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2018-12-08 13:26:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,306 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-08 13:26:57,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-08 13:26:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 13:26:57,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:26:57,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1909121887, now seen corresponding path program 1 times [2018-12-08 13:26:57,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,328 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-08 13:26:57,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,329 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2018-12-08 13:26:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,340 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-08 13:26:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-08 13:26:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,341 INFO L225 Difference]: With dead ends: 85 [2018-12-08 13:26:57,341 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 13:26:57,342 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-08 13:26:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 13:26:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 13:26:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 13:26:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-12-08 13:26:57,346 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-12-08 13:26:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,347 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-12-08 13:26:57,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-12-08 13:26:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 13:26:57,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:26:57,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123809, now seen corresponding path program 1 times [2018-12-08 13:26:57,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,377 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-08 13:26:57,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:26:57,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:26:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:26:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:26:57,378 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-12-08 13:26:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,420 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-12-08 13:26:57,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:26:57,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-08 13:26:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,421 INFO L225 Difference]: With dead ends: 84 [2018-12-08 13:26:57,421 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 13:26:57,421 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-08 13:26:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 13:26:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-08 13:26:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 13:26:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-12-08 13:26:57,425 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2018-12-08 13:26:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,425 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-12-08 13:26:57,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:26:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-12-08 13:26:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 13:26:57,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,426 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-08 13:26:57,426 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash -44725957, now seen corresponding path program 1 times [2018-12-08 13:26:57,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,449 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-08 13:26:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,450 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-12-08 13:26:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,475 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-12-08 13:26:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-08 13:26:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,476 INFO L225 Difference]: With dead ends: 83 [2018-12-08 13:26:57,476 INFO L226 Difference]: Without dead ends: 79 [2018-12-08 13:26:57,477 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-08 13:26:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-08 13:26:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-08 13:26:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 13:26:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-08 13:26:57,480 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2018-12-08 13:26:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,480 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-08 13:26:57,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-08 13:26:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 13:26:57,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,481 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-08 13:26:57,481 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1386500464, now seen corresponding path program 1 times [2018-12-08 13:26:57,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,507 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-08 13:26:57,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:26:57,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:26:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:26:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:26:57,508 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2018-12-08 13:26:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,546 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2018-12-08 13:26:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:26:57,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-08 13:26:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,547 INFO L225 Difference]: With dead ends: 136 [2018-12-08 13:26:57,547 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 13:26:57,547 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-08 13:26:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 13:26:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-12-08 13:26:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 13:26:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-12-08 13:26:57,551 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2018-12-08 13:26:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,551 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-12-08 13:26:57,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:26:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-12-08 13:26:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 13:26:57,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,551 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-08 13:26:57,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash 725856891, now seen corresponding path program 1 times [2018-12-08 13:26:57,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,568 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-08 13:26:57,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,569 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2018-12-08 13:26:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,581 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-12-08 13:26:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 13:26:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,582 INFO L225 Difference]: With dead ends: 141 [2018-12-08 13:26:57,582 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 13:26:57,582 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-08 13:26:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 13:26:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-12-08 13:26:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 13:26:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-08 13:26:57,586 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2018-12-08 13:26:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,586 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-08 13:26:57,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-08 13:26:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:26:57,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,587 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-08 13:26:57,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1026716690, now seen corresponding path program 1 times [2018-12-08 13:26:57,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,610 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-08 13:26:57,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,611 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2018-12-08 13:26:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,619 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-08 13:26:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 13:26:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,620 INFO L225 Difference]: With dead ends: 78 [2018-12-08 13:26:57,620 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 13:26:57,621 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-08 13:26:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 13:26:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-08 13:26:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 13:26:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-08 13:26:57,624 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2018-12-08 13:26:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,624 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-08 13:26:57,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-08 13:26:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 13:26:57,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,625 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-08 13:26:57,625 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1611661129, now seen corresponding path program 1 times [2018-12-08 13:26:57,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,641 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-08 13:26:57,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:57,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:57,642 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-12-08 13:26:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,653 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-08 13:26:57,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:57,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 13:26:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,654 INFO L225 Difference]: With dead ends: 79 [2018-12-08 13:26:57,654 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 13:26:57,654 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-08 13:26:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 13:26:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-08 13:26:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 13:26:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-12-08 13:26:57,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2018-12-08 13:26:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,658 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-12-08 13:26:57,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-12-08 13:26:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 13:26:57,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,659 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-08 13:26:57,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1611663051, now seen corresponding path program 1 times [2018-12-08 13:26:57,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,693 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-08 13:26:57,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:26:57,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:26:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:26:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:26:57,694 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 4 states. [2018-12-08 13:26:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,734 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-08 13:26:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:26:57,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-08 13:26:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,735 INFO L225 Difference]: With dead ends: 78 [2018-12-08 13:26:57,735 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 13:26:57,735 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-08 13:26:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 13:26:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-08 13:26:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 13:26:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-12-08 13:26:57,738 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2018-12-08 13:26:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,738 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-12-08 13:26:57,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:26:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-12-08 13:26:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:26:57,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,738 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-08 13:26:57,739 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1836072976, now seen corresponding path program 1 times [2018-12-08 13:26:57,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,768 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-08 13:26:57,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:26:57,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:26:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:26:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:26:57,769 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-12-08 13:26:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:57,831 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-12-08 13:26:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:26:57,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-08 13:26:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:57,832 INFO L225 Difference]: With dead ends: 190 [2018-12-08 13:26:57,832 INFO L226 Difference]: Without dead ends: 128 [2018-12-08 13:26:57,832 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-08 13:26:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-08 13:26:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-12-08 13:26:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 13:26:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-08 13:26:57,835 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2018-12-08 13:26:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:57,836 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-08 13:26:57,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:26:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-08 13:26:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:26:57,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:57,836 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-08 13:26:57,837 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:57,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash 870546418, now seen corresponding path program 1 times [2018-12-08 13:26:57,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:57,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:57,887 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-08 13:26:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 13:26:57,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:26:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:26:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:26:57,888 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-12-08 13:26:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:58,028 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-12-08 13:26:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 13:26:58,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 13:26:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:58,029 INFO L225 Difference]: With dead ends: 182 [2018-12-08 13:26:58,029 INFO L226 Difference]: Without dead ends: 139 [2018-12-08 13:26:58,030 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-08 13:26:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-08 13:26:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2018-12-08 13:26:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 13:26:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-08 13:26:58,034 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2018-12-08 13:26:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-08 13:26:58,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:26:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-08 13:26:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:26:58,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:58,035 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-08 13:26:58,035 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:58,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash 769950578, now seen corresponding path program 1 times [2018-12-08 13:26:58,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:58,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:58,174 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-08 13:26:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 13:26:58,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 13:26:58,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 13:26:58,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 13:26:58,176 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-08 13:26:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:58,451 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-12-08 13:26:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 13:26:58,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-08 13:26:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:58,453 INFO L225 Difference]: With dead ends: 241 [2018-12-08 13:26:58,453 INFO L226 Difference]: Without dead ends: 239 [2018-12-08 13:26:58,453 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-08 13:26:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-08 13:26:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2018-12-08 13:26:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 13:26:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-08 13:26:58,458 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2018-12-08 13:26:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:58,459 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-08 13:26:58,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 13:26:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-08 13:26:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:26:58,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:58,459 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-08 13:26:58,460 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:58,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1506132002, now seen corresponding path program 1 times [2018-12-08 13:26:58,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:58,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:58,508 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-08 13:26:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:58,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:26:58,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 13:26:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 13:26:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 13:26:58,509 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-12-08 13:26:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:58,577 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-12-08 13:26:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:26:58,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-08 13:26:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:58,578 INFO L225 Difference]: With dead ends: 145 [2018-12-08 13:26:58,578 INFO L226 Difference]: Without dead ends: 127 [2018-12-08 13:26:58,578 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-08 13:26:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-08 13:26:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-12-08 13:26:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 13:26:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-12-08 13:26:58,582 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2018-12-08 13:26:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:58,583 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-12-08 13:26:58,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 13:26:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-12-08 13:26:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:26:58,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:58,584 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-08 13:26:58,584 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:58,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash -677189726, now seen corresponding path program 1 times [2018-12-08 13:26:58,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:58,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:58,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:58,597 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-08 13:26:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:26:58,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:26:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:26:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:26:58,597 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2018-12-08 13:26:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:58,620 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-12-08 13:26:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:26:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 13:26:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:58,621 INFO L225 Difference]: With dead ends: 119 [2018-12-08 13:26:58,621 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 13:26:58,621 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-08 13:26:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 13:26:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-08 13:26:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 13:26:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2018-12-08 13:26:58,626 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2018-12-08 13:26:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:58,626 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2018-12-08 13:26:58,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:26:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2018-12-08 13:26:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 13:26:58,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:58,626 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-08 13:26:58,627 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:58,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1818543518, now seen corresponding path program 1 times [2018-12-08 13:26:58,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:58,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:58,757 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-08 13:26:58,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:58,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 13:26:58,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 13:26:58,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 13:26:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 13:26:58,758 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 7 states. [2018-12-08 13:26:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:58,987 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-12-08 13:26:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 13:26:58,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-08 13:26:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:58,989 INFO L225 Difference]: With dead ends: 277 [2018-12-08 13:26:58,989 INFO L226 Difference]: Without dead ends: 275 [2018-12-08 13:26:58,989 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-08 13:26:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-08 13:26:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2018-12-08 13:26:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-08 13:26:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-12-08 13:26:58,995 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2018-12-08 13:26:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:58,995 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-12-08 13:26:58,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 13:26:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-12-08 13:26:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 13:26:58,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:58,996 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-08 13:26:58,996 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:58,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash -828341282, now seen corresponding path program 1 times [2018-12-08 13:26:58,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:58,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:59,032 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-08 13:26:59,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:26:59,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:26:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:59,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:26:59,101 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-08 13:26:59,103 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-08 13:26:59,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,121 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-08 13:26:59,123 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-08 13:26:59,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-08 13:26:59,143 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-08 13:26:59,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:26:59,146 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-08 13:26:59,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,170 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-08 13:26:59,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:26:59,173 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-08 13:26:59,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-08 13:26:59,213 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-08 13:26:59,215 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-08 13:26:59,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,222 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-08 13:26:59,223 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-08 13:26:59,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,226 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-08 13:26:59,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-12-08 13:26:59,232 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-08 13:26:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:26:59,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-12-08 13:26:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 13:26:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 13:26:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 13:26:59,249 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2018-12-08 13:26:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:59,412 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2018-12-08 13:26:59,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 13:26:59,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-08 13:26:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:59,413 INFO L225 Difference]: With dead ends: 224 [2018-12-08 13:26:59,413 INFO L226 Difference]: Without dead ends: 162 [2018-12-08 13:26:59,413 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-08 13:26:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-08 13:26:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2018-12-08 13:26:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 13:26:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-12-08 13:26:59,421 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-12-08 13:26:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:59,421 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-12-08 13:26:59,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 13:26:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-12-08 13:26:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 13:26:59,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:59,422 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-08 13:26:59,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:59,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -693545280, now seen corresponding path program 1 times [2018-12-08 13:26:59,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:59,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:59,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:59,533 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-08 13:26:59,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:26:59,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 13:26:59,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:26:59,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:26:59,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:26:59,534 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-12-08 13:26:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:26:59,649 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-12-08 13:26:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:26:59,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-08 13:26:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:26:59,650 INFO L225 Difference]: With dead ends: 165 [2018-12-08 13:26:59,650 INFO L226 Difference]: Without dead ends: 145 [2018-12-08 13:26:59,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 13:26:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-08 13:26:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-12-08 13:26:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-08 13:26:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-12-08 13:26:59,659 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2018-12-08 13:26:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:26:59,659 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-12-08 13:26:59,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:26:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-12-08 13:26:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 13:26:59,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:26:59,660 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-08 13:26:59,660 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:26:59,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:26:59,660 INFO L82 PathProgramCache]: Analyzing trace with hash 928343854, now seen corresponding path program 1 times [2018-12-08 13:26:59,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:26:59,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:26:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:59,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:26:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:59,724 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-08 13:26:59,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:26:59,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:26:59,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:26:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:26:59,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:26:59,746 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-08 13:26:59,748 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-08 13:26:59,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-08 13:26:59,803 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-08 13:26:59,805 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-08 13:26:59,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,813 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-08 13:26:59,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:26:59,815 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-08 13:26:59,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:26:59,819 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-08 13:26:59,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-12-08 13:26:59,821 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-08 13:26:59,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:26:59,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-12-08 13:26:59,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 13:26:59,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 13:26:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 13:26:59,837 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2018-12-08 13:27:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:00,021 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-12-08 13:27:00,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 13:27:00,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-08 13:27:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:27:00,022 INFO L225 Difference]: With dead ends: 225 [2018-12-08 13:27:00,022 INFO L226 Difference]: Without dead ends: 194 [2018-12-08 13:27:00,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 13:27:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-08 13:27:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2018-12-08 13:27:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-08 13:27:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-12-08 13:27:00,031 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2018-12-08 13:27:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:27:00,031 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-12-08 13:27:00,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 13:27:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-12-08 13:27:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 13:27:00,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:27:00,032 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-08 13:27:00,032 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:27:00,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash 36989377, now seen corresponding path program 1 times [2018-12-08 13:27:00,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:00,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:00,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:00,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:00,046 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-08 13:27:00,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:27:00,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:27:00,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:27:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:27:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:27:00,047 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2018-12-08 13:27:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:00,061 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2018-12-08 13:27:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:27:00,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 13:27:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:27:00,062 INFO L225 Difference]: With dead ends: 297 [2018-12-08 13:27:00,062 INFO L226 Difference]: Without dead ends: 215 [2018-12-08 13:27:00,062 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-08 13:27:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-08 13:27:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2018-12-08 13:27:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-08 13:27:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2018-12-08 13:27:00,071 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2018-12-08 13:27:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:27:00,071 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2018-12-08 13:27:00,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:27:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2018-12-08 13:27:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:27:00,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:27:00,072 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-08 13:27:00,072 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:27:00,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1278661403, now seen corresponding path program 1 times [2018-12-08 13:27:00,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:00,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:00,097 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-08 13:27:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:27:00,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:27:00,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:27:00,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:27:00,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:27:00,098 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 4 states. [2018-12-08 13:27:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:00,153 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2018-12-08 13:27:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:27:00,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-08 13:27:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:27:00,154 INFO L225 Difference]: With dead ends: 291 [2018-12-08 13:27:00,154 INFO L226 Difference]: Without dead ends: 182 [2018-12-08 13:27:00,155 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-08 13:27:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-08 13:27:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-12-08 13:27:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 13:27:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2018-12-08 13:27:00,166 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 40 [2018-12-08 13:27:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:27:00,167 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2018-12-08 13:27:00,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:27:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2018-12-08 13:27:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:27:00,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:27:00,168 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-08 13:27:00,168 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:27:00,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 257593049, now seen corresponding path program 1 times [2018-12-08 13:27:00,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:00,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:00,367 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-08 13:27:00,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:27:00,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:27:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:00,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:00,390 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-08 13:27:00,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 13:27:00,409 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-08 13:27:00,411 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-08 13:27:00,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,418 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-08 13:27:00,419 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-08 13:27:00,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-08 13:27:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,458 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-08 13:27:00,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,473 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-08 13:27:00,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,478 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-08 13:27:00,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,491 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-08 13:27:00,492 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-08 13:27:00,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,503 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-08 13:27:00,520 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-08 13:27:00,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,524 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-08 13:27:00,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,532 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-08 13:27:00,534 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-08 13:27:00,534 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,539 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,542 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-08 13:27:00,549 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-08 13:27:00,550 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-12-08 13:27:00,572 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-08 13:27:00,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,576 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-08 13:27:00,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,605 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-08 13:27:00,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,609 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-08 13:27:00,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,625 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-08 13:27:00,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-12-08 13:27:00,687 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-08 13:27:00,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,690 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-08 13:27:00,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,699 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-08 13:27:00,700 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-08 13:27:00,705 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-08 13:27:00,713 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-08 13:27:00,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:00,715 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-08 13:27:00,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,720 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-08 13:27:00,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:00,725 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-08 13:27:00,726 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-12-08 13:27:00,740 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-08 13:27:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:27:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-08 13:27:00,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 13:27:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 13:27:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2018-12-08 13:27:00,756 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 17 states. [2018-12-08 13:27:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:01,541 INFO L93 Difference]: Finished difference Result 479 states and 565 transitions. [2018-12-08 13:27:01,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 13:27:01,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-08 13:27:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:27:01,542 INFO L225 Difference]: With dead ends: 479 [2018-12-08 13:27:01,542 INFO L226 Difference]: Without dead ends: 387 [2018-12-08 13:27:01,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=736, Unknown=2, NotChecked=0, Total=992 [2018-12-08 13:27:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-08 13:27:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2018-12-08 13:27:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-08 13:27:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-12-08 13:27:01,552 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 40 [2018-12-08 13:27:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:27:01,553 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-12-08 13:27:01,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 13:27:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-12-08 13:27:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:27:01,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:27:01,553 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-08 13:27:01,553 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:27:01,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -427010471, now seen corresponding path program 1 times [2018-12-08 13:27:01,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:01,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:01,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:01,809 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-08 13:27:01,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:27:01,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/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-08 13:27:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:01,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:01,839 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-08 13:27:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:01,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:01,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 13:27:01,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:01,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:01,892 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-08 13:27:01,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:01,924 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-08 13:27:02,016 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-08 13:27:02,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,049 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-08 13:27:02,052 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-08 13:27:02,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,073 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-08 13:27:02,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,077 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-08 13:27:02,078 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,093 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,104 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-08 13:27:02,114 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-08 13:27:02,131 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-08 13:27:02,157 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-08 13:27:02,158 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,167 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-08 13:27:02,169 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-08 13:27:02,169 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,178 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-08 13:27:02,180 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-08 13:27:02,181 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,185 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,189 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-08 13:27:02,194 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-08 13:27:02,211 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-08 13:27:02,211 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2018-12-08 13:27:02,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,265 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-08 13:27:02,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,296 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-08 13:27:02,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,300 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-08 13:27:02,300 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,323 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-08 13:27:02,325 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-08 13:27:02,325 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,346 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-08 13:27:02,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,367 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-08 13:27:02,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,370 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-08 13:27:02,370 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,385 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-08 13:27:02,387 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-08 13:27:02,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,398 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,404 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-08 13:27:02,417 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-08 13:27:02,417 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:153, output treesize:114 [2018-12-08 13:27:02,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,462 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-08 13:27:02,465 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-08 13:27:02,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,505 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-08 13:27:02,508 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-08 13:27:02,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:130 [2018-12-08 13:27:02,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:02,636 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-08 13:27:02,648 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-08 13:27:02,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,662 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-08 13:27:02,662 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-08 13:27:02,673 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:02,674 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-08 13:27:02,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,684 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-08 13:27:02,697 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-08 13:27:02,699 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-08 13:27:02,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,705 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-08 13:27:02,705 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:02,710 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-08 13:27:02,710 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:149, output treesize:7 [2018-12-08 13:27:02,718 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-08 13:27:02,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:27:02,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-08 13:27:02,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 13:27:02,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 13:27:02,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2018-12-08 13:27:02,738 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 17 states. [2018-12-08 13:27:03,545 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-08 13:27:04,136 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-12-08 13:27:04,435 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2018-12-08 13:27:04,770 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 99 [2018-12-08 13:27:04,973 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-08 13:27:05,868 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-08 13:27:06,683 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-12-08 13:27:06,958 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-12-08 13:27:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:07,741 INFO L93 Difference]: Finished difference Result 778 states and 904 transitions. [2018-12-08 13:27:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-08 13:27:07,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-08 13:27:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:27:07,743 INFO L225 Difference]: With dead ends: 778 [2018-12-08 13:27:07,743 INFO L226 Difference]: Without dead ends: 776 [2018-12-08 13:27:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=555, Invalid=1700, Unknown=1, NotChecked=0, Total=2256 [2018-12-08 13:27:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-12-08 13:27:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 249. [2018-12-08 13:27:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 13:27:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2018-12-08 13:27:07,757 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 40 [2018-12-08 13:27:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:27:07,757 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2018-12-08 13:27:07,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 13:27:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2018-12-08 13:27:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:27:07,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:27:07,758 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-08 13:27:07,758 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 13:27:07,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1953426060, now seen corresponding path program 1 times [2018-12-08 13:27:07,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:07,782 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 13:27:07,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 01:27:07 BoogieIcfgContainer [2018-12-08 13:27:07,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 13:27:07,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:27:07,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:27:07,804 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:27:07,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:26:57" (3/4) ... [2018-12-08 13:27:07,806 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 13:27:07,834 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cd47cf2a-387a-4ac0-ae5b-cd612fb7eeeb/bin-2019/uautomizer/witness.graphml [2018-12-08 13:27:07,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:27:07,835 INFO L168 Benchmark]: Toolchain (without parser) took 11362.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 950.6 MB in the beginning and 858.0 MB in the end (delta: 92.6 MB). Peak memory consumption was 439.7 MB. Max. memory is 11.5 GB. [2018-12-08 13:27:07,835 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:27:07,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-08 13:27:07,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:27:07,836 INFO L168 Benchmark]: Boogie Preprocessor took 25.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:27:07,836 INFO L168 Benchmark]: RCFGBuilder took 264.62 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-08 13:27:07,836 INFO L168 Benchmark]: TraceAbstraction took 10725.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.6 MB). Free memory was 1.1 GB in the beginning and 858.0 MB in the end (delta: 215.0 MB). Peak memory consumption was 432.6 MB. Max. memory is 11.5 GB. [2018-12-08 13:27:07,836 INFO L168 Benchmark]: Witness Printer took 30.15 ms. Allocated memory is still 1.4 GB. Free memory was 858.0 MB in the beginning and 858.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-08 13:27:07,837 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 264.62 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10725.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.6 MB). Free memory was 1.1 GB in the beginning and 858.0 MB in the end (delta: 215.0 MB). Peak memory consumption was 432.6 MB. Max. memory is 11.5 GB. * Witness Printer took 30.15 ms. Allocated memory is still 1.4 GB. Free memory was 858.0 MB in the beginning and 858.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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))={12:0}, malloc(sizeof(SLL))={15: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))={12:0}, malloc(sizeof(SLL))={15:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15: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))={12:0}, malloc(sizeof(SLL))={15:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15: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))={12:0}, malloc(sizeof(SLL))={15: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))={12:0}, malloc(sizeof(SLL))={15:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15: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))={12:0}, malloc(sizeof(SLL))={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 10.6s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 7.3s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 5.3s 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...