./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be78f24495f6395b0c8bd7d622003423e0349301 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-0ed9222-m [2019-01-13 05:53:04,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:53:04,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:53:04,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:53:04,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:53:04,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:53:04,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:53:04,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:53:04,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:53:04,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:53:04,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:53:04,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:53:04,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:53:04,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:53:04,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:53:04,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:53:04,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:53:04,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:53:04,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:53:04,968 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:53:04,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:53:04,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:53:04,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:53:04,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:53:04,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:53:04,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:53:04,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:53:04,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:53:04,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:53:04,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:53:04,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:53:04,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:53:04,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:53:04,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:53:04,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:53:04,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:53:04,985 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:53:05,017 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:53:05,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:53:05,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:53:05,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:53:05,020 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:53:05,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:53:05,020 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:53:05,021 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:53:05,022 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:53:05,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:53:05,024 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:53:05,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:53:05,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:53:05,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:53:05,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:53:05,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:53:05,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:53:05,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:53:05,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:53:05,028 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:53:05,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:53:05,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:53:05,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:53:05,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be78f24495f6395b0c8bd7d622003423e0349301 [2019-01-13 05:53:05,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:53:05,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:53:05,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:53:05,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:53:05,111 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:53:05,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i [2019-01-13 05:53:05,172 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d491622/2c374ef62a014a15bef40a72ac566d80/FLAG3933f8172 [2019-01-13 05:53:05,800 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:53:05,801 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i [2019-01-13 05:53:05,835 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d491622/2c374ef62a014a15bef40a72ac566d80/FLAG3933f8172 [2019-01-13 05:53:05,975 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d491622/2c374ef62a014a15bef40a72ac566d80 [2019-01-13 05:53:05,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:53:05,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:53:05,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:53:05,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:53:05,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:53:05,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138808c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05, skipping insertion in model container [2019-01-13 05:53:05,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:53:06,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:53:06,794 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:53:06,805 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:53:06,983 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:53:07,451 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:53:07,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07 WrapperNode [2019-01-13 05:53:07,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:53:07,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:53:07,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:53:07,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:53:07,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:53:07,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:53:07,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:53:07,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:53:07,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... [2019-01-13 05:53:07,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:53:07,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:53:07,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:53:07,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:53:07,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:53:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:53:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 05:53:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 05:53:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:53:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:53:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-01-13 05:53:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-01-13 05:53:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:53:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:53:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 05:53:07,826 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:53:08,994 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:53:08,995 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-13 05:53:08,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:08 BoogieIcfgContainer [2019-01-13 05:53:08,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:53:08,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:53:09,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:53:09,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:53:09,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:53:05" (1/3) ... [2019-01-13 05:53:09,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46d7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:53:09, skipping insertion in model container [2019-01-13 05:53:09,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:07" (2/3) ... [2019-01-13 05:53:09,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46d7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:53:09, skipping insertion in model container [2019-01-13 05:53:09,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:08" (3/3) ... [2019-01-13 05:53:09,006 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global_false-unreach-call.i [2019-01-13 05:53:09,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,045 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,045 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,045 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,046 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,046 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,046 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,046 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,046 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,047 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,047 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,047 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,047 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,048 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,048 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,048 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,049 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,050 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,050 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,050 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,053 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,053 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,053 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:09,094 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:53:09,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:53:09,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-13 05:53:09,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-13 05:53:09,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:53:09,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:53:09,143 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:53:09,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:53:09,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:53:09,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:53:09,144 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:53:09,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:53:09,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:53:09,158 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137places, 145 transitions [2019-01-13 05:53:09,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4725 states. [2019-01-13 05:53:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states. [2019-01-13 05:53:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 05:53:09,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:09,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:09,369 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash 441784776, now seen corresponding path program 1 times [2019-01-13 05:53:09,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:09,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:10,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:53:10,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:53:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:53:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:53:10,139 INFO L87 Difference]: Start difference. First operand 4725 states. Second operand 6 states. [2019-01-13 05:53:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:11,020 INFO L93 Difference]: Finished difference Result 4724 states and 12876 transitions. [2019-01-13 05:53:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:53:11,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-13 05:53:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:11,073 INFO L225 Difference]: With dead ends: 4724 [2019-01-13 05:53:11,074 INFO L226 Difference]: Without dead ends: 3864 [2019-01-13 05:53:11,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:53:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-01-13 05:53:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3863. [2019-01-13 05:53:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2019-01-13 05:53:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 10474 transitions. [2019-01-13 05:53:11,343 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 10474 transitions. Word has length 31 [2019-01-13 05:53:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:11,344 INFO L480 AbstractCegarLoop]: Abstraction has 3863 states and 10474 transitions. [2019-01-13 05:53:11,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:53:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 10474 transitions. [2019-01-13 05:53:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 05:53:11,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:11,348 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, 1] [2019-01-13 05:53:11,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -804856226, now seen corresponding path program 1 times [2019-01-13 05:53:11,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:11,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:11,838 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-13 05:53:12,116 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-13 05:53:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:12,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:12,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:12,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:12,183 INFO L87 Difference]: Start difference. First operand 3863 states and 10474 transitions. Second operand 8 states. [2019-01-13 05:53:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:13,400 INFO L93 Difference]: Finished difference Result 3865 states and 10476 transitions. [2019-01-13 05:53:13,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:53:13,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-01-13 05:53:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:13,427 INFO L225 Difference]: With dead ends: 3865 [2019-01-13 05:53:13,427 INFO L226 Difference]: Without dead ends: 3865 [2019-01-13 05:53:13,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-13 05:53:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-01-13 05:53:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3861. [2019-01-13 05:53:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-01-13 05:53:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 10472 transitions. [2019-01-13 05:53:13,542 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 10472 transitions. Word has length 37 [2019-01-13 05:53:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:13,542 INFO L480 AbstractCegarLoop]: Abstraction has 3861 states and 10472 transitions. [2019-01-13 05:53:13,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 10472 transitions. [2019-01-13 05:53:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 05:53:13,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:13,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:13,550 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1378309502, now seen corresponding path program 1 times [2019-01-13 05:53:13,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:13,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:14,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:14,034 INFO L87 Difference]: Start difference. First operand 3861 states and 10472 transitions. Second operand 8 states. [2019-01-13 05:53:14,772 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-13 05:53:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:15,789 INFO L93 Difference]: Finished difference Result 5825 states and 15810 transitions. [2019-01-13 05:53:15,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 05:53:15,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-01-13 05:53:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:15,828 INFO L225 Difference]: With dead ends: 5825 [2019-01-13 05:53:15,829 INFO L226 Difference]: Without dead ends: 5825 [2019-01-13 05:53:15,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-01-13 05:53:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2019-01-13 05:53:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 4385. [2019-01-13 05:53:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4385 states. [2019-01-13 05:53:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 11916 transitions. [2019-01-13 05:53:15,970 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 11916 transitions. Word has length 55 [2019-01-13 05:53:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:15,971 INFO L480 AbstractCegarLoop]: Abstraction has 4385 states and 11916 transitions. [2019-01-13 05:53:15,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 11916 transitions. [2019-01-13 05:53:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 05:53:15,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:15,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:15,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1957942992, now seen corresponding path program 1 times [2019-01-13 05:53:15,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:15,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:15,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:15,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:15,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:16,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:16,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:16,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:16,250 INFO L87 Difference]: Start difference. First operand 4385 states and 11916 transitions. Second operand 8 states. [2019-01-13 05:53:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:17,431 INFO L93 Difference]: Finished difference Result 6349 states and 17158 transitions. [2019-01-13 05:53:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 05:53:17,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-13 05:53:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:17,464 INFO L225 Difference]: With dead ends: 6349 [2019-01-13 05:53:17,464 INFO L226 Difference]: Without dead ends: 5317 [2019-01-13 05:53:17,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-13 05:53:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2019-01-13 05:53:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5125. [2019-01-13 05:53:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5125 states. [2019-01-13 05:53:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 13985 transitions. [2019-01-13 05:53:17,659 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 13985 transitions. Word has length 61 [2019-01-13 05:53:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:17,660 INFO L480 AbstractCegarLoop]: Abstraction has 5125 states and 13985 transitions. [2019-01-13 05:53:17,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 13985 transitions. [2019-01-13 05:53:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 05:53:17,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:17,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:17,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2138401985, now seen corresponding path program 1 times [2019-01-13 05:53:17,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:53:17,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:53:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:53:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:53:17,920 INFO L87 Difference]: Start difference. First operand 5125 states and 13985 transitions. Second operand 5 states. [2019-01-13 05:53:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:17,993 INFO L93 Difference]: Finished difference Result 1780 states and 4650 transitions. [2019-01-13 05:53:17,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:53:17,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 05:53:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:18,001 INFO L225 Difference]: With dead ends: 1780 [2019-01-13 05:53:18,001 INFO L226 Difference]: Without dead ends: 1780 [2019-01-13 05:53:18,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-01-13 05:53:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2019-01-13 05:53:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-01-13 05:53:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 4650 transitions. [2019-01-13 05:53:18,046 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 4650 transitions. Word has length 67 [2019-01-13 05:53:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:18,047 INFO L480 AbstractCegarLoop]: Abstraction has 1780 states and 4650 transitions. [2019-01-13 05:53:18,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:53:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 4650 transitions. [2019-01-13 05:53:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 05:53:18,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:18,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:18,054 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash -379051754, now seen corresponding path program 1 times [2019-01-13 05:53:18,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:18,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:18,560 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 05:53:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:19,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:19,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 05:53:19,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 05:53:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 05:53:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-13 05:53:19,840 INFO L87 Difference]: Start difference. First operand 1780 states and 4650 transitions. Second operand 20 states. [2019-01-13 05:53:20,457 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-13 05:53:20,612 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-13 05:53:20,790 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-13 05:53:21,068 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-13 05:53:21,335 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-13 05:53:21,555 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-13 05:53:22,001 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-01-13 05:53:22,278 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-13 05:53:22,530 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-13 05:53:22,795 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-01-13 05:53:23,108 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-13 05:53:23,401 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-13 05:53:23,691 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-01-13 05:53:24,002 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-13 05:53:24,282 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-01-13 05:53:24,640 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-13 05:53:24,987 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-01-13 05:53:25,357 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-01-13 05:53:25,965 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-13 05:53:26,209 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-13 05:53:26,463 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-01-13 05:53:26,653 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-13 05:53:26,781 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-01-13 05:53:26,960 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-13 05:53:27,212 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-01-13 05:53:27,377 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-13 05:53:27,555 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-13 05:53:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:27,572 INFO L93 Difference]: Finished difference Result 2069 states and 5251 transitions. [2019-01-13 05:53:27,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-13 05:53:27,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-13 05:53:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:27,578 INFO L225 Difference]: With dead ends: 2069 [2019-01-13 05:53:27,578 INFO L226 Difference]: Without dead ends: 2069 [2019-01-13 05:53:27,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=612, Invalid=1644, Unknown=0, NotChecked=0, Total=2256 [2019-01-13 05:53:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-01-13 05:53:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2061. [2019-01-13 05:53:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-01-13 05:53:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 5244 transitions. [2019-01-13 05:53:27,621 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 5244 transitions. Word has length 96 [2019-01-13 05:53:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:27,622 INFO L480 AbstractCegarLoop]: Abstraction has 2061 states and 5244 transitions. [2019-01-13 05:53:27,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 05:53:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 5244 transitions. [2019-01-13 05:53:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 05:53:27,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:27,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:27,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash 910623962, now seen corresponding path program 2 times [2019-01-13 05:53:27,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:27,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:28,059 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 05:53:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:29,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 05:53:29,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 05:53:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 05:53:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-13 05:53:29,152 INFO L87 Difference]: Start difference. First operand 2061 states and 5244 transitions. Second operand 20 states. [2019-01-13 05:53:29,797 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-13 05:53:30,223 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-13 05:53:30,467 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-13 05:53:30,713 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-13 05:53:30,997 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-01-13 05:53:31,268 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-13 05:53:31,525 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-13 05:53:32,015 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-13 05:53:32,295 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-13 05:53:32,588 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-13 05:53:32,831 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-13 05:53:33,148 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-13 05:53:33,424 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-01-13 05:53:33,830 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-13 05:53:34,133 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-13 05:53:34,562 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-01-13 05:53:35,157 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-13 05:53:35,458 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-13 05:53:35,735 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-01-13 05:53:36,002 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-13 05:53:36,150 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-13 05:53:36,336 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-13 05:53:36,602 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-01-13 05:53:36,798 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-13 05:53:37,013 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-13 05:53:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:37,037 INFO L93 Difference]: Finished difference Result 2331 states and 5789 transitions. [2019-01-13 05:53:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-13 05:53:37,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-13 05:53:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:37,045 INFO L225 Difference]: With dead ends: 2331 [2019-01-13 05:53:37,046 INFO L226 Difference]: Without dead ends: 2331 [2019-01-13 05:53:37,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=631, Invalid=1625, Unknown=0, NotChecked=0, Total=2256 [2019-01-13 05:53:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2019-01-13 05:53:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2034. [2019-01-13 05:53:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-01-13 05:53:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 5181 transitions. [2019-01-13 05:53:37,092 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 5181 transitions. Word has length 96 [2019-01-13 05:53:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:37,092 INFO L480 AbstractCegarLoop]: Abstraction has 2034 states and 5181 transitions. [2019-01-13 05:53:37,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 05:53:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 5181 transitions. [2019-01-13 05:53:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 05:53:37,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:37,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:37,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -321205186, now seen corresponding path program 3 times [2019-01-13 05:53:37,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:37,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:53:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:37,485 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 05:53:37,660 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 05:53:38,014 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-13 05:53:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:39,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:39,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 05:53:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 05:53:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 05:53:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-13 05:53:39,014 INFO L87 Difference]: Start difference. First operand 2034 states and 5181 transitions. Second operand 20 states. [2019-01-13 05:53:39,662 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-13 05:53:39,908 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-13 05:53:40,121 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-13 05:53:40,326 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-13 05:53:40,572 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-01-13 05:53:40,859 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-13 05:53:41,135 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-13 05:53:41,356 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-13 05:53:41,625 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-13 05:53:41,898 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-13 05:53:42,214 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-13 05:53:42,493 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-13 05:53:42,844 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-01-13 05:53:43,412 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-13 05:53:43,714 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-01-13 05:53:44,082 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-13 05:53:44,398 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-13 05:53:44,700 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-13 05:53:45,026 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-01-13 05:53:45,819 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-13 05:53:46,154 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-13 05:53:46,423 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-13 05:53:46,709 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-01-13 05:53:46,915 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-01-13 05:53:47,133 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-13 05:53:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:47,147 INFO L93 Difference]: Finished difference Result 2065 states and 5226 transitions. [2019-01-13 05:53:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-13 05:53:47,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-13 05:53:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:47,155 INFO L225 Difference]: With dead ends: 2065 [2019-01-13 05:53:47,155 INFO L226 Difference]: Without dead ends: 2065 [2019-01-13 05:53:47,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=659, Invalid=1597, Unknown=0, NotChecked=0, Total=2256 [2019-01-13 05:53:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2019-01-13 05:53:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1778. [2019-01-13 05:53:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-01-13 05:53:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4648 transitions. [2019-01-13 05:53:47,199 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4648 transitions. Word has length 96 [2019-01-13 05:53:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:47,200 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 4648 transitions. [2019-01-13 05:53:47,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 05:53:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4648 transitions. [2019-01-13 05:53:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:53:47,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:47,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:47,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 911245093, now seen corresponding path program 1 times [2019-01-13 05:53:47,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:47,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:47,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:53:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:48,533 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2019-01-13 05:53:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:50,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 05:53:50,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 05:53:50,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 05:53:50,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-01-13 05:53:50,248 INFO L87 Difference]: Start difference. First operand 1778 states and 4648 transitions. Second operand 27 states. [2019-01-13 05:53:51,184 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 05:53:51,438 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:53:51,782 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-13 05:53:52,146 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-01-13 05:53:52,506 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-13 05:53:52,853 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-13 05:53:53,290 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-13 05:53:53,544 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-13 05:53:53,714 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-13 05:53:54,370 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-13 05:53:55,126 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-13 05:53:55,331 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-13 05:53:55,583 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-01-13 05:53:55,758 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-01-13 05:53:56,028 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-01-13 05:53:56,254 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-01-13 05:53:56,637 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-01-13 05:53:56,861 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-01-13 05:53:57,323 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-13 05:53:57,502 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-13 05:53:57,674 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-13 05:53:59,823 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-13 05:53:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:59,824 INFO L93 Difference]: Finished difference Result 2578 states and 6470 transitions. [2019-01-13 05:53:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-13 05:53:59,824 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-13 05:53:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:59,831 INFO L225 Difference]: With dead ends: 2578 [2019-01-13 05:53:59,831 INFO L226 Difference]: Without dead ends: 2399 [2019-01-13 05:53:59,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=663, Invalid=3369, Unknown=0, NotChecked=0, Total=4032 [2019-01-13 05:53:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2019-01-13 05:53:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1778. [2019-01-13 05:53:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-01-13 05:53:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4636 transitions. [2019-01-13 05:53:59,877 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4636 transitions. Word has length 102 [2019-01-13 05:53:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:59,877 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 4636 transitions. [2019-01-13 05:53:59,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 05:53:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4636 transitions. [2019-01-13 05:53:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:53:59,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:59,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:59,886 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1954643991, now seen corresponding path program 2 times [2019-01-13 05:53:59,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:02,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:02,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 05:54:02,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 05:54:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 05:54:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-13 05:54:02,336 INFO L87 Difference]: Start difference. First operand 1778 states and 4636 transitions. Second operand 27 states. [2019-01-13 05:54:03,256 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 05:54:03,452 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:54:03,697 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 05:54:04,038 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-13 05:54:04,387 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-13 05:54:04,759 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-01-13 05:54:05,174 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-01-13 05:54:05,376 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-13 05:54:06,104 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-13 05:54:06,271 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-13 05:54:06,480 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 05:54:07,249 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-01-13 05:54:07,417 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-01-13 05:54:07,653 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-01-13 05:54:07,847 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-01-13 05:54:08,317 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-01-13 05:54:08,539 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-01-13 05:54:08,744 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-13 05:54:08,907 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-13 05:54:09,079 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-13 05:54:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:54:10,470 INFO L93 Difference]: Finished difference Result 2648 states and 6761 transitions. [2019-01-13 05:54:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 05:54:10,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-13 05:54:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:54:10,475 INFO L225 Difference]: With dead ends: 2648 [2019-01-13 05:54:10,475 INFO L226 Difference]: Without dead ends: 2508 [2019-01-13 05:54:10,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=611, Invalid=2929, Unknown=0, NotChecked=0, Total=3540 [2019-01-13 05:54:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-01-13 05:54:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1822. [2019-01-13 05:54:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-01-13 05:54:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 4753 transitions. [2019-01-13 05:54:10,553 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 4753 transitions. Word has length 102 [2019-01-13 05:54:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:54:10,554 INFO L480 AbstractCegarLoop]: Abstraction has 1822 states and 4753 transitions. [2019-01-13 05:54:10,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 05:54:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 4753 transitions. [2019-01-13 05:54:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:54:10,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:54:10,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:54:10,563 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:54:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:54:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1775250509, now seen corresponding path program 3 times [2019-01-13 05:54:10,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:54:10,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:54:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:10,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:54:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:11,238 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-01-13 05:54:11,359 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-01-13 05:54:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:13,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:13,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 05:54:13,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 05:54:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 05:54:13,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-13 05:54:13,108 INFO L87 Difference]: Start difference. First operand 1822 states and 4753 transitions. Second operand 27 states. [2019-01-13 05:54:13,970 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 05:54:14,187 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:54:14,444 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 05:54:14,821 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-13 05:54:15,205 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-13 05:54:15,567 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-13 05:54:16,024 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-13 05:54:16,256 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-13 05:54:16,461 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-13 05:54:17,153 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-13 05:54:17,338 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-13 05:54:17,573 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-01-13 05:54:17,771 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 05:54:18,025 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-01-13 05:54:18,923 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-01-13 05:54:19,208 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-01-13 05:54:19,526 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-01-13 05:54:19,758 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-01-13 05:54:19,993 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-13 05:54:20,183 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-13 05:54:20,583 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-13 05:54:21,942 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-13 05:54:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:54:22,102 INFO L93 Difference]: Finished difference Result 2609 states and 6673 transitions. [2019-01-13 05:54:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 05:54:22,103 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-13 05:54:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:54:22,109 INFO L225 Difference]: With dead ends: 2609 [2019-01-13 05:54:22,109 INFO L226 Difference]: Without dead ends: 2482 [2019-01-13 05:54:22,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=611, Invalid=2929, Unknown=0, NotChecked=0, Total=3540 [2019-01-13 05:54:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-01-13 05:54:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 1910. [2019-01-13 05:54:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-01-13 05:54:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4987 transitions. [2019-01-13 05:54:22,156 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4987 transitions. Word has length 102 [2019-01-13 05:54:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:54:22,156 INFO L480 AbstractCegarLoop]: Abstraction has 1910 states and 4987 transitions. [2019-01-13 05:54:22,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 05:54:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4987 transitions. [2019-01-13 05:54:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:54:22,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:54:22,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:54:22,164 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:54:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:54:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -435024759, now seen corresponding path program 4 times [2019-01-13 05:54:22,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:54:22,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:54:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:22,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:54:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:22,916 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 05:54:23,053 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 05:54:23,809 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-01-13 05:54:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:25,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 05:54:25,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 05:54:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 05:54:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-01-13 05:54:25,165 INFO L87 Difference]: Start difference. First operand 1910 states and 4987 transitions. Second operand 27 states. [2019-01-13 05:54:26,066 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 05:54:26,278 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:54:26,538 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 05:54:26,946 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-13 05:54:27,400 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-13 05:54:27,765 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-13 05:54:28,277 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-13 05:54:28,544 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-13 05:54:28,715 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-13 05:54:29,372 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-13 05:54:29,562 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-13 05:54:29,837 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-01-13 05:54:30,038 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 05:54:30,284 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-01-13 05:54:30,660 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-01-13 05:54:30,908 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-13 05:54:31,127 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-13 05:54:31,338 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-13 05:54:31,551 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-13 05:54:32,923 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-13 05:54:33,100 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-13 05:54:33,296 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-13 05:54:33,470 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-13 05:54:33,760 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-13 05:54:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:54:34,948 INFO L93 Difference]: Finished difference Result 2798 states and 7119 transitions. [2019-01-13 05:54:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-13 05:54:34,948 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-13 05:54:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:54:34,953 INFO L225 Difference]: With dead ends: 2798 [2019-01-13 05:54:34,953 INFO L226 Difference]: Without dead ends: 2534 [2019-01-13 05:54:34,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=674, Invalid=3232, Unknown=0, NotChecked=0, Total=3906 [2019-01-13 05:54:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-01-13 05:54:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1954. [2019-01-13 05:54:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-01-13 05:54:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 5064 transitions. [2019-01-13 05:54:35,001 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 5064 transitions. Word has length 102 [2019-01-13 05:54:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:54:35,002 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 5064 transitions. [2019-01-13 05:54:35,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 05:54:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 5064 transitions. [2019-01-13 05:54:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:54:35,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:54:35,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:54:35,014 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:54:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:54:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash 537140045, now seen corresponding path program 5 times [2019-01-13 05:54:35,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:54:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:54:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:35,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:54:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:35,521 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-13 05:54:36,026 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 05:54:36,161 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 05:54:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:37,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:37,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 05:54:37,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 05:54:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 05:54:37,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-13 05:54:37,919 INFO L87 Difference]: Start difference. First operand 1954 states and 5064 transitions. Second operand 27 states. [2019-01-13 05:54:38,454 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-13 05:54:38,837 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 05:54:39,044 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:54:39,312 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 05:54:39,686 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-13 05:54:40,065 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-13 05:54:40,427 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-13 05:54:40,892 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-13 05:54:41,113 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-13 05:54:41,295 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-13 05:54:42,060 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-13 05:54:42,240 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-13 05:54:42,483 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-01-13 05:54:42,683 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 05:54:42,925 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-01-13 05:54:43,274 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-01-13 05:54:43,519 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-13 05:54:44,183 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-01-13 05:54:44,428 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-13 05:54:44,655 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-13 05:54:44,875 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-13 05:54:45,045 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-01-13 05:54:45,220 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-13 05:54:45,388 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-13 05:54:45,552 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-13 05:54:46,081 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-13 05:54:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:54:47,179 INFO L93 Difference]: Finished difference Result 2635 states and 6663 transitions. [2019-01-13 05:54:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-13 05:54:47,181 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-13 05:54:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:54:47,184 INFO L225 Difference]: With dead ends: 2635 [2019-01-13 05:54:47,184 INFO L226 Difference]: Without dead ends: 2214 [2019-01-13 05:54:47,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=714, Invalid=3446, Unknown=0, NotChecked=0, Total=4160 [2019-01-13 05:54:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-01-13 05:54:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1634. [2019-01-13 05:54:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-01-13 05:54:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 4228 transitions. [2019-01-13 05:54:47,214 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 4228 transitions. Word has length 102 [2019-01-13 05:54:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:54:47,214 INFO L480 AbstractCegarLoop]: Abstraction has 1634 states and 4228 transitions. [2019-01-13 05:54:47,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 05:54:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 4228 transitions. [2019-01-13 05:54:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:54:47,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:54:47,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:54:47,221 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:54:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:54:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1227855465, now seen corresponding path program 6 times [2019-01-13 05:54:47,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:54:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:54:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:47,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:54:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:47,782 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-13 05:54:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-13 05:54:49,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 05:54:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 05:54:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-13 05:54:49,833 INFO L87 Difference]: Start difference. First operand 1634 states and 4228 transitions. Second operand 25 states. [2019-01-13 05:54:50,557 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-01-13 05:54:50,726 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-13 05:54:50,937 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-13 05:54:51,266 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-01-13 05:54:51,689 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-13 05:54:51,986 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-01-13 05:54:52,395 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-13 05:54:52,603 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-13 05:54:53,130 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-01-13 05:54:53,310 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-01-13 05:54:53,721 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-01-13 05:54:53,873 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-01-13 05:54:54,105 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-13 05:54:54,302 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-01-13 05:54:54,622 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-01-13 05:54:54,873 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-01-13 05:54:55,115 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-01-13 05:54:55,429 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-13 05:54:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:54:57,170 INFO L93 Difference]: Finished difference Result 2213 states and 5524 transitions. [2019-01-13 05:54:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-13 05:54:57,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-01-13 05:54:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:54:57,173 INFO L225 Difference]: With dead ends: 2213 [2019-01-13 05:54:57,173 INFO L226 Difference]: Without dead ends: 2034 [2019-01-13 05:54:57,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=643, Invalid=3017, Unknown=0, NotChecked=0, Total=3660 [2019-01-13 05:54:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-01-13 05:54:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1674. [2019-01-13 05:54:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-01-13 05:54:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 4304 transitions. [2019-01-13 05:54:57,203 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 4304 transitions. Word has length 102 [2019-01-13 05:54:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:54:57,204 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 4304 transitions. [2019-01-13 05:54:57,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 05:54:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 4304 transitions. [2019-01-13 05:54:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:54:57,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:54:57,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:54:57,208 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:54:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:54:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1212803365, now seen corresponding path program 7 times [2019-01-13 05:54:57,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:54:57,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:54:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:57,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:54:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:54:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:54:57,888 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2019-01-13 05:54:58,018 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2019-01-13 05:54:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:54:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:54:59,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-13 05:54:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 05:54:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 05:54:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-13 05:54:59,457 INFO L87 Difference]: Start difference. First operand 1674 states and 4304 transitions. Second operand 25 states. [2019-01-13 05:55:00,349 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-13 05:55:00,560 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-13 05:55:00,882 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-01-13 05:55:01,287 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-13 05:55:01,577 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-01-13 05:55:01,988 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-01-13 05:55:02,676 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 05:55:02,933 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-13 05:55:03,159 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-13 05:55:03,584 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-01-13 05:55:03,754 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-13 05:55:04,055 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-01-13 05:55:04,255 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-13 05:55:04,469 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-01-13 05:55:04,803 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-01-13 05:55:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:55:06,547 INFO L93 Difference]: Finished difference Result 2195 states and 5482 transitions. [2019-01-13 05:55:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-13 05:55:06,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-01-13 05:55:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:55:06,551 INFO L225 Difference]: With dead ends: 2195 [2019-01-13 05:55:06,551 INFO L226 Difference]: Without dead ends: 2055 [2019-01-13 05:55:06,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=621, Invalid=2919, Unknown=0, NotChecked=0, Total=3540 [2019-01-13 05:55:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-01-13 05:55:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1676. [2019-01-13 05:55:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-01-13 05:55:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 4307 transitions. [2019-01-13 05:55:06,581 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 4307 transitions. Word has length 102 [2019-01-13 05:55:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:55:06,582 INFO L480 AbstractCegarLoop]: Abstraction has 1676 states and 4307 transitions. [2019-01-13 05:55:06,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 05:55:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 4307 transitions. [2019-01-13 05:55:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:55:06,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:55:06,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:55:06,586 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:55:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:55:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash -787254771, now seen corresponding path program 8 times [2019-01-13 05:55:06,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:55:06,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:55:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:06,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:55:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:55:07,870 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-01-13 05:55:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:55:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:55:09,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-13 05:55:09,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 05:55:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 05:55:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-13 05:55:09,072 INFO L87 Difference]: Start difference. First operand 1676 states and 4307 transitions. Second operand 25 states. [2019-01-13 05:55:09,788 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-01-13 05:55:09,964 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-13 05:55:10,176 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-13 05:55:10,501 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-01-13 05:55:10,937 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-01-13 05:55:11,255 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-01-13 05:55:11,694 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-01-13 05:55:11,904 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-13 05:55:12,426 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-13 05:55:12,649 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-01-13 05:55:12,880 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-13 05:55:13,200 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-01-13 05:55:13,702 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-01-13 05:55:13,890 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-13 05:55:14,114 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-01-13 05:55:14,517 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-13 05:55:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:55:16,352 INFO L93 Difference]: Finished difference Result 2156 states and 5396 transitions. [2019-01-13 05:55:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 05:55:16,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-01-13 05:55:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:55:16,356 INFO L225 Difference]: With dead ends: 2156 [2019-01-13 05:55:16,356 INFO L226 Difference]: Without dead ends: 2029 [2019-01-13 05:55:16,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=602, Invalid=2820, Unknown=0, NotChecked=0, Total=3422 [2019-01-13 05:55:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-01-13 05:55:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1680. [2019-01-13 05:55:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2019-01-13 05:55:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 4313 transitions. [2019-01-13 05:55:16,380 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 4313 transitions. Word has length 102 [2019-01-13 05:55:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:55:16,380 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 4313 transitions. [2019-01-13 05:55:16,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 05:55:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 4313 transitions. [2019-01-13 05:55:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:55:16,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:55:16,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:55:16,384 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:55:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:55:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1722602445, now seen corresponding path program 1 times [2019-01-13 05:55:16,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:55:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:55:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:16,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:55:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:55:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:55:17,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:55:17,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-13 05:55:17,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 05:55:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 05:55:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-01-13 05:55:17,458 INFO L87 Difference]: Start difference. First operand 1680 states and 4313 transitions. Second operand 21 states. [2019-01-13 05:55:18,110 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-13 05:55:18,277 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-13 05:55:18,451 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-01-13 05:55:18,727 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 05:55:18,885 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-01-13 05:55:19,064 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-01-13 05:55:19,558 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-13 05:55:19,753 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-01-13 05:55:19,929 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-01-13 05:55:20,179 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-13 05:55:20,392 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-01-13 05:55:20,757 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-01-13 05:55:21,001 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-13 05:55:21,206 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-01-13 05:55:21,404 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-01-13 05:55:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:55:22,034 INFO L93 Difference]: Finished difference Result 1891 states and 4727 transitions. [2019-01-13 05:55:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 05:55:22,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-01-13 05:55:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:55:22,038 INFO L225 Difference]: With dead ends: 1891 [2019-01-13 05:55:22,039 INFO L226 Difference]: Without dead ends: 1856 [2019-01-13 05:55:22,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=503, Invalid=1137, Unknown=0, NotChecked=0, Total=1640 [2019-01-13 05:55:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2019-01-13 05:55:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1792. [2019-01-13 05:55:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-01-13 05:55:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 4571 transitions. [2019-01-13 05:55:22,076 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 4571 transitions. Word has length 102 [2019-01-13 05:55:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:55:22,076 INFO L480 AbstractCegarLoop]: Abstraction has 1792 states and 4571 transitions. [2019-01-13 05:55:22,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 05:55:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 4571 transitions. [2019-01-13 05:55:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 05:55:22,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:55:22,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:55:22,084 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:55:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:55:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -309227767, now seen corresponding path program 9 times [2019-01-13 05:55:22,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:55:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:55:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:55:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:55:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:55:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:55:22,204 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:55:22,319 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:55:22,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:55:22 BasicIcfg [2019-01-13 05:55:22,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:55:22,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:55:22,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:55:22,326 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:55:22,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:08" (3/4) ... [2019-01-13 05:55:22,332 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:55:22,437 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:55:22,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:55:22,438 INFO L168 Benchmark]: Toolchain (without parser) took 136458.42 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 837.8 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -307.3 MB). Peak memory consumption was 530.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:55:22,438 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:55:22,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1472.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 89.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:55:22,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:55:22,441 INFO L168 Benchmark]: Boogie Preprocessor took 98.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:55:22,441 INFO L168 Benchmark]: RCFGBuilder took 1268.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 966.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:55:22,441 INFO L168 Benchmark]: TraceAbstraction took 133325.30 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.8 MB). Free memory was 966.4 MB in the beginning and 1.3 GB in the end (delta: -301.6 MB). Peak memory consumption was 384.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:55:22,441 INFO L168 Benchmark]: Witness Printer took 111.00 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-01-13 05:55:22,446 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1472.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 89.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1268.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 966.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 133325.30 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.8 MB). Free memory was 966.4 MB in the beginning and 1.3 GB in the end (delta: -301.6 MB). Peak memory consumption was 384.2 MB. Max. memory is 11.5 GB. * Witness Printer took 111.00 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3772]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L3774] -1 pthread_t t1,t2; VAL [t1={1:0}, t2={-1:0}] [L3791] -1 struct device *my_dev; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3839] -1 return 0; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3847] -1 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3848] COND TRUE -1 ret==0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3849] -1 int probe_ret; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3850] -1 struct my_data data; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3809] -1 data->shared.a = 0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3810] -1 data->shared.b = 0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3811] -1 data->shared.a VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3812] -1 data->shared.b VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3814] -1 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3815] COND FALSE -1 !(\read(res)) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3819] -1 my_dev = &data->dev VAL [my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3822] FCALL, FORK -1 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3794] 0 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 0 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 0 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3799] 0 data->shared.a = 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 0 data->shared.b VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3823] FCALL, FORK -1 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3824] -1 return 0; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3794] 1 struct my_data *data; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3851] -1 probe_ret = my_drv_probe(&data) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3852] COND TRUE -1 probe_ret==0 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3832] -1 void *status; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3833] -1 \read(t1) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3799] 1 data->shared.a = 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] EXPR 1 data->shared.b VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3802] 1 return 0; VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 0 data->shared.b = data->shared.b + 1 VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3802] 0 return 0; VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3833] FCALL, JOIN 0 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3834] -1 \read(t2) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3834] FCALL, JOIN 1 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3854] -1 data.shared.a VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3855] -1 data.shared.b VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] COND TRUE -1 !expression VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] -1 __VERIFIER_error() VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 6 error locations. UNSAFE Result, 133.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 101.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2958 SDtfs, 12719 SDslu, 25275 SDs, 0 SdLazy, 14817 SolverSat, 1535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 45 SyntacticMatches, 41 SemanticMatches, 717 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7138 ImplicationChecksByTransitivity, 94.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5125occurred in iteration=4, 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: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 6420 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 1559 NumberOfCodeBlocks, 1559 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 2277513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...