./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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-2_5-container_of_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 f304bbeec274f04c648f2bacc19ae28d00889b1b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-91b1670 [2018-11-28 20:44:33,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:44:33,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:44:33,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:44:33,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:44:33,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:44:33,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:44:33,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:44:33,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:44:33,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:44:33,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:44:33,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:44:33,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:44:33,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:44:33,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:44:33,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:44:33,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:44:33,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:44:33,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:44:33,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:44:33,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:44:33,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:44:34,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:44:34,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:44:34,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:44:34,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:44:34,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:44:34,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:44:34,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:44:34,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:44:34,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:44:34,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:44:34,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:44:34,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:44:34,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:44:34,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:44:34,010 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:44:34,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:44:34,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:44:34,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:44:34,027 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:44:34,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:44:34,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:44:34,028 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:44:34,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:44:34,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:44:34,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:44:34,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:44:34,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:44:34,031 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:44:34,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:44:34,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:44:34,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:44:34,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:44:34,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:44:34,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:44:34,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:44:34,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:44:34,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:44:34,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:44:34,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:44:34,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:44:34,035 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 -> f304bbeec274f04c648f2bacc19ae28d00889b1b [2018-11-28 20:44:34,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:44:34,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:44:34,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:44:34,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:44:34,093 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:44:34,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i [2018-11-28 20:44:34,162 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6d9233c/c7d48d5b95274180be9343a2f1f97ceb/FLAGe51e02ffc [2018-11-28 20:44:34,766 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:44:34,767 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i [2018-11-28 20:44:34,792 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6d9233c/c7d48d5b95274180be9343a2f1f97ceb/FLAGe51e02ffc [2018-11-28 20:44:34,980 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6d9233c/c7d48d5b95274180be9343a2f1f97ceb [2018-11-28 20:44:34,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:44:34,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:44:34,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:44:34,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:44:34,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:44:34,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:34" (1/1) ... [2018-11-28 20:44:34,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a170e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34, skipping insertion in model container [2018-11-28 20:44:35,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:34" (1/1) ... [2018-11-28 20:44:35,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:44:35,097 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:44:36,017 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:44:36,031 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:44:36,278 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:44:36,648 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:44:36,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36 WrapperNode [2018-11-28 20:44:36,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:44:36,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:44:36,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:44:36,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:44:36,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:44:36,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:44:36,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:44:36,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:44:36,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... [2018-11-28 20:44:36,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:44:36,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:44:36,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:44:36,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:44:36,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:44:36,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:44:36,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:44:36,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 20:44:36,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2018-11-28 20:44:36,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 20:44:36,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:44:36,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:44:36,933 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2018-11-28 20:44:36,933 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2018-11-28 20:44:36,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:44:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 20:44:36,936 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:44:38,037 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:44:38,042 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-28 20:44:38,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:38 BoogieIcfgContainer [2018-11-28 20:44:38,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:44:38,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:44:38,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:44:38,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:44:38,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:44:34" (1/3) ... [2018-11-28 20:44:38,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fe07c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:38, skipping insertion in model container [2018-11-28 20:44:38,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:36" (2/3) ... [2018-11-28 20:44:38,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fe07c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:38, skipping insertion in model container [2018-11-28 20:44:38,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:38" (3/3) ... [2018-11-28 20:44:38,055 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of_false-unreach-call.i [2018-11-28 20:44:38,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,099 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,099 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,101 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,101 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,101 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,101 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,101 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,103 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,103 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,104 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,104 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,104 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,104 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,105 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,105 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,106 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,106 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,106 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,109 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,110 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,110 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,115 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,115 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,115 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,116 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,116 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,116 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,116 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,118 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,122 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,123 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,123 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,123 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,123 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,124 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,124 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,124 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,125 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,125 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,125 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,127 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,127 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,128 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:44:38,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:44:38,164 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:44:38,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-28 20:44:38,193 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-28 20:44:38,221 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:44:38,222 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:44:38,222 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:44:38,222 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:44:38,223 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:44:38,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:44:38,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:44:38,223 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:44:38,223 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:44:38,238 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 154 transitions [2018-11-28 20:44:38,621 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9148 states. [2018-11-28 20:44:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9148 states. [2018-11-28 20:44:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:44:38,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:38,648 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] [2018-11-28 20:44:38,651 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:38,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1070418997, now seen corresponding path program 1 times [2018-11-28 20:44:38,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:38,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:39,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:44:39,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:44:39,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:44:39,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:44:39,372 INFO L87 Difference]: Start difference. First operand 9148 states. Second operand 6 states. [2018-11-28 20:44:39,912 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 20:44:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:41,620 INFO L93 Difference]: Finished difference Result 13043 states and 36091 transitions. [2018-11-28 20:44:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:44:41,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-28 20:44:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:41,722 INFO L225 Difference]: With dead ends: 13043 [2018-11-28 20:44:41,723 INFO L226 Difference]: Without dead ends: 10972 [2018-11-28 20:44:41,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:44:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10972 states. [2018-11-28 20:44:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10972 to 8396. [2018-11-28 20:44:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2018-11-28 20:44:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 22955 transitions. [2018-11-28 20:44:42,141 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 22955 transitions. Word has length 43 [2018-11-28 20:44:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:42,142 INFO L480 AbstractCegarLoop]: Abstraction has 8396 states and 22955 transitions. [2018-11-28 20:44:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:44:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 22955 transitions. [2018-11-28 20:44:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 20:44:42,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:42,151 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] [2018-11-28 20:44:42,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:42,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash -31792251, now seen corresponding path program 1 times [2018-11-28 20:44:42,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:42,726 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-28 20:44:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:42,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:42,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:44:42,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:44:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:44:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:44:42,915 INFO L87 Difference]: Start difference. First operand 8396 states and 22955 transitions. Second operand 8 states. [2018-11-28 20:44:43,518 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 20:44:44,025 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-28 20:44:44,600 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-28 20:44:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:45,844 INFO L93 Difference]: Finished difference Result 11652 states and 31765 transitions. [2018-11-28 20:44:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:44:45,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 20:44:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:45,899 INFO L225 Difference]: With dead ends: 11652 [2018-11-28 20:44:45,899 INFO L226 Difference]: Without dead ends: 9858 [2018-11-28 20:44:45,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:44:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2018-11-28 20:44:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 9536. [2018-11-28 20:44:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9536 states. [2018-11-28 20:44:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9536 states to 9536 states and 26143 transitions. [2018-11-28 20:44:46,165 INFO L78 Accepts]: Start accepts. Automaton has 9536 states and 26143 transitions. Word has length 49 [2018-11-28 20:44:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:46,165 INFO L480 AbstractCegarLoop]: Abstraction has 9536 states and 26143 transitions. [2018-11-28 20:44:46,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:44:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9536 states and 26143 transitions. [2018-11-28 20:44:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 20:44:46,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:46,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:44:46,177 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:46,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash 62479644, now seen corresponding path program 1 times [2018-11-28 20:44:46,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:46,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:46,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:46,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:44:46,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:44:46,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:44:46,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:44:46,561 INFO L87 Difference]: Start difference. First operand 9536 states and 26143 transitions. Second operand 5 states. [2018-11-28 20:44:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:46,758 INFO L93 Difference]: Finished difference Result 3711 states and 9633 transitions. [2018-11-28 20:44:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:44:46,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-28 20:44:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:46,773 INFO L225 Difference]: With dead ends: 3711 [2018-11-28 20:44:46,773 INFO L226 Difference]: Without dead ends: 3711 [2018-11-28 20:44:46,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:44:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-11-28 20:44:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2018-11-28 20:44:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2018-11-28 20:44:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9633 transitions. [2018-11-28 20:44:46,887 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9633 transitions. Word has length 57 [2018-11-28 20:44:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:46,888 INFO L480 AbstractCegarLoop]: Abstraction has 3711 states and 9633 transitions. [2018-11-28 20:44:46,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:44:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9633 transitions. [2018-11-28 20:44:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:44:46,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:46,900 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] [2018-11-28 20:44:46,900 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:46,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1130195445, now seen corresponding path program 1 times [2018-11-28 20:44:46,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:46,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:46,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:47,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:47,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:44:47,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:44:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:44:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:44:47,580 INFO L87 Difference]: Start difference. First operand 3711 states and 9633 transitions. Second operand 6 states. [2018-11-28 20:44:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:48,319 INFO L93 Difference]: Finished difference Result 4030 states and 10208 transitions. [2018-11-28 20:44:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:44:48,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-28 20:44:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:48,331 INFO L225 Difference]: With dead ends: 4030 [2018-11-28 20:44:48,331 INFO L226 Difference]: Without dead ends: 4030 [2018-11-28 20:44:48,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:44:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2018-11-28 20:44:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3763. [2018-11-28 20:44:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2018-11-28 20:44:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9725 transitions. [2018-11-28 20:44:48,427 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9725 transitions. Word has length 72 [2018-11-28 20:44:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:48,428 INFO L480 AbstractCegarLoop]: Abstraction has 3763 states and 9725 transitions. [2018-11-28 20:44:48,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:44:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9725 transitions. [2018-11-28 20:44:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 20:44:48,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:48,438 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] [2018-11-28 20:44:48,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:48,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1425213711, now seen corresponding path program 1 times [2018-11-28 20:44:48,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:48,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:44:48,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:44:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:44:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:44:48,801 INFO L87 Difference]: Start difference. First operand 3763 states and 9725 transitions. Second operand 8 states. [2018-11-28 20:44:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:50,164 INFO L93 Difference]: Finished difference Result 4117 states and 10347 transitions. [2018-11-28 20:44:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:44:50,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-28 20:44:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:50,176 INFO L225 Difference]: With dead ends: 4117 [2018-11-28 20:44:50,176 INFO L226 Difference]: Without dead ends: 4117 [2018-11-28 20:44:50,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:44:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2018-11-28 20:44:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3941. [2018-11-28 20:44:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2018-11-28 20:44:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10065 transitions. [2018-11-28 20:44:50,280 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10065 transitions. Word has length 78 [2018-11-28 20:44:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:50,281 INFO L480 AbstractCegarLoop]: Abstraction has 3941 states and 10065 transitions. [2018-11-28 20:44:50,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:44:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10065 transitions. [2018-11-28 20:44:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:44:50,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:50,292 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] [2018-11-28 20:44:50,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:50,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash -813547254, now seen corresponding path program 1 times [2018-11-28 20:44:50,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:50,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:50,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:50,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:52,070 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 21 [2018-11-28 20:44:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:52,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:52,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 20:44:52,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 20:44:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 20:44:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:44:52,327 INFO L87 Difference]: Start difference. First operand 3941 states and 10065 transitions. Second operand 20 states. [2018-11-28 20:44:53,622 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-28 20:44:53,899 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-28 20:44:54,203 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-28 20:44:54,447 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-28 20:44:54,738 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-28 20:44:55,066 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-28 20:44:55,486 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-28 20:44:55,893 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-28 20:44:56,592 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-28 20:44:56,913 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-28 20:44:57,098 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-28 20:44:57,245 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-28 20:44:57,533 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-28 20:44:57,761 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-28 20:44:58,242 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-28 20:44:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:58,476 INFO L93 Difference]: Finished difference Result 15823 states and 39686 transitions. [2018-11-28 20:44:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 20:44:58,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-28 20:44:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:58,496 INFO L225 Difference]: With dead ends: 15823 [2018-11-28 20:44:58,496 INFO L226 Difference]: Without dead ends: 15823 [2018-11-28 20:44:58,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=495, Invalid=1227, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 20:44:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15823 states. [2018-11-28 20:44:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15823 to 4344. [2018-11-28 20:44:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-11-28 20:44:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 11165 transitions. [2018-11-28 20:44:58,676 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 11165 transitions. Word has length 80 [2018-11-28 20:44:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:58,676 INFO L480 AbstractCegarLoop]: Abstraction has 4344 states and 11165 transitions. [2018-11-28 20:44:58,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 20:44:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 11165 transitions. [2018-11-28 20:44:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:44:58,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:58,689 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] [2018-11-28 20:44:58,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:58,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 999875789, now seen corresponding path program 1 times [2018-11-28 20:44:58,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:44:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:44:59,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:44:59,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:44:59,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:44:59,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:44:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:44:59,402 INFO L87 Difference]: Start difference. First operand 4344 states and 11165 transitions. Second operand 8 states. [2018-11-28 20:44:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:44:59,887 INFO L93 Difference]: Finished difference Result 4551 states and 11558 transitions. [2018-11-28 20:44:59,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:44:59,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-11-28 20:44:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:44:59,892 INFO L225 Difference]: With dead ends: 4551 [2018-11-28 20:44:59,892 INFO L226 Difference]: Without dead ends: 4551 [2018-11-28 20:44:59,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:44:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2018-11-28 20:44:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4521. [2018-11-28 20:44:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4521 states. [2018-11-28 20:44:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 11500 transitions. [2018-11-28 20:44:59,974 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 11500 transitions. Word has length 80 [2018-11-28 20:44:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:44:59,974 INFO L480 AbstractCegarLoop]: Abstraction has 4521 states and 11500 transitions. [2018-11-28 20:44:59,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:44:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 11500 transitions. [2018-11-28 20:44:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:44:59,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:44:59,984 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] [2018-11-28 20:44:59,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:44:59,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:44:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash -985313931, now seen corresponding path program 2 times [2018-11-28 20:44:59,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:44:59,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:44:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:44:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:44:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:45:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:45:00,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:45:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 20:45:00,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 20:45:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 20:45:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-28 20:45:00,767 INFO L87 Difference]: Start difference. First operand 4521 states and 11500 transitions. Second operand 17 states. [2018-11-28 20:45:01,590 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-28 20:45:02,453 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-28 20:45:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:45:02,956 INFO L93 Difference]: Finished difference Result 4398 states and 11243 transitions. [2018-11-28 20:45:02,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 20:45:02,957 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-11-28 20:45:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:45:02,962 INFO L225 Difference]: With dead ends: 4398 [2018-11-28 20:45:02,963 INFO L226 Difference]: Without dead ends: 4398 [2018-11-28 20:45:02,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 20:45:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2018-11-28 20:45:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4247. [2018-11-28 20:45:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4247 states. [2018-11-28 20:45:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 10962 transitions. [2018-11-28 20:45:03,042 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 10962 transitions. Word has length 80 [2018-11-28 20:45:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:45:03,042 INFO L480 AbstractCegarLoop]: Abstraction has 4247 states and 10962 transitions. [2018-11-28 20:45:03,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 20:45:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 10962 transitions. [2018-11-28 20:45:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:45:03,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:45:03,053 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] [2018-11-28 20:45:03,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:45:03,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:45:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -115689686, now seen corresponding path program 2 times [2018-11-28 20:45:03,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:45:03,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:45:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:03,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:45:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:45:04,024 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 20:45:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:45:04,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:45:04,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 20:45:04,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 20:45:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 20:45:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:45:04,559 INFO L87 Difference]: Start difference. First operand 4247 states and 10962 transitions. Second operand 20 states. [2018-11-28 20:45:05,356 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-28 20:45:05,555 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-28 20:45:05,809 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-28 20:45:06,084 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-28 20:45:06,365 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-28 20:45:06,815 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-28 20:45:07,231 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-28 20:45:07,629 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-28 20:45:08,280 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-28 20:45:08,542 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-28 20:45:08,954 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-28 20:45:09,338 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-28 20:45:09,538 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-28 20:45:09,864 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-28 20:45:10,271 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-28 20:45:10,631 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-28 20:45:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:45:10,896 INFO L93 Difference]: Finished difference Result 17586 states and 44106 transitions. [2018-11-28 20:45:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 20:45:10,897 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-28 20:45:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:45:10,922 INFO L225 Difference]: With dead ends: 17586 [2018-11-28 20:45:10,922 INFO L226 Difference]: Without dead ends: 17586 [2018-11-28 20:45:10,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 20:45:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17586 states. [2018-11-28 20:45:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17586 to 4260. [2018-11-28 20:45:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2018-11-28 20:45:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 11000 transitions. [2018-11-28 20:45:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 11000 transitions. Word has length 80 [2018-11-28 20:45:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:45:11,129 INFO L480 AbstractCegarLoop]: Abstraction has 4260 states and 11000 transitions. [2018-11-28 20:45:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 20:45:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 11000 transitions. [2018-11-28 20:45:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:45:11,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:45:11,141 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] [2018-11-28 20:45:11,142 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:45:11,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:45:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash -108089652, now seen corresponding path program 3 times [2018-11-28 20:45:11,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:45:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:45:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:11,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:45:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:45:11,745 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:45:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:45:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:45:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 20:45:12,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 20:45:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 20:45:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:45:12,626 INFO L87 Difference]: Start difference. First operand 4260 states and 11000 transitions. Second operand 20 states. [2018-11-28 20:45:13,407 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-28 20:45:13,615 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-28 20:45:13,978 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-28 20:45:14,258 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-28 20:45:14,545 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-28 20:45:14,924 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-28 20:45:15,293 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-28 20:45:15,679 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-28 20:45:16,304 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-28 20:45:16,498 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-28 20:45:16,653 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-28 20:45:16,965 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-28 20:45:17,222 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-28 20:45:17,692 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-28 20:45:17,968 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-28 20:45:18,337 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-11-28 20:45:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:45:18,587 INFO L93 Difference]: Finished difference Result 16472 states and 41078 transitions. [2018-11-28 20:45:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 20:45:18,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-28 20:45:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:45:18,611 INFO L225 Difference]: With dead ends: 16472 [2018-11-28 20:45:18,611 INFO L226 Difference]: Without dead ends: 16472 [2018-11-28 20:45:18,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=538, Invalid=1268, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 20:45:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16472 states. [2018-11-28 20:45:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16472 to 4355. [2018-11-28 20:45:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-11-28 20:45:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 11192 transitions. [2018-11-28 20:45:18,790 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 11192 transitions. Word has length 80 [2018-11-28 20:45:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:45:18,790 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 11192 transitions. [2018-11-28 20:45:18,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 20:45:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 11192 transitions. [2018-11-28 20:45:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 20:45:18,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:45:18,804 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] [2018-11-28 20:45:18,804 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:45:18,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:45:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1836511402, now seen corresponding path program 4 times [2018-11-28 20:45:18,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:45:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:45:18,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:18,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:45:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:45:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:45:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:45:18,928 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:45:19,061 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:45:19,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:45:19 BasicIcfg [2018-11-28 20:45:19,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:45:19,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:45:19,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:45:19,070 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:45:19,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:38" (3/4) ... [2018-11-28 20:45:19,076 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:45:19,198 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:45:19,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:45:19,200 INFO L168 Benchmark]: Toolchain (without parser) took 44214.85 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 665.8 MB). Free memory was 947.2 MB in the beginning and 1.3 GB in the end (delta: -400.2 MB). Peak memory consumption was 265.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,202 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:45:19,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1661.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.2 MB in the beginning and 1.0 GB in the end (delta: -76.7 MB). Peak memory consumption was 91.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,204 INFO L168 Benchmark]: Boogie Preprocessor took 80.86 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. [2018-11-28 20:45:19,204 INFO L168 Benchmark]: RCFGBuilder took 1174.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,206 INFO L168 Benchmark]: TraceAbstraction took 41021.73 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 512.8 MB). Free memory was 965.3 MB in the beginning and 1.4 GB in the end (delta: -398.1 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,208 INFO L168 Benchmark]: Witness Printer took 128.56 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:45:19,212 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1661.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.2 MB in the beginning and 1.0 GB in the end (delta: -76.7 MB). Peak memory consumption was 91.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.86 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 1174.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41021.73 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 512.8 MB). Free memory was 965.3 MB in the beginning and 1.4 GB in the end (delta: -398.1 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * Witness Printer took 128.56 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 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={68:0}, t2={58:0}] [L3839] -1 return 0; VAL [t1={68:0}, t2={58:0}] [L3847] -1 int ret = my_drv_init(); VAL [t1={68:0}, t2={58:0}] [L3848] COND TRUE -1 ret==0 VAL [t1={68:0}, t2={58:0}] [L3849] -1 int probe_ret; VAL [t1={68:0}, t2={58:0}] [L3850] -1 struct my_data data; VAL [t1={68:0}, t2={58:0}] [L3804] -1 struct device *d = &data->dev; VAL [t1={68:0}, t2={58:0}] [L3809] -1 data->shared.a = 0 VAL [t1={68:0}, t2={58:0}] [L3810] -1 data->shared.b = 0 VAL [t1={68:0}, t2={58:0}] [L3812] -1 int res = __VERIFIER_nondet_int(); VAL [t1={68:0}, t2={58:0}] [L3813] COND FALSE -1 !(\read(res)) VAL [t1={68:0}, t2={58:0}] [L3816] FCALL, FORK -1 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={62:40}, t1={68:0}, t2={58:0}] [L3817] FCALL, FORK -1 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={62:40}, t1={68:0}, t2={58:0}] [L3818] -1 return 0; VAL [arg={62:40}, t1={68:0}, t2={58:0}] [L3792] 0 struct device *dev = (struct device*)arg; VAL [arg={62:40}, arg={62:40}, dev={62:40}, t1={68:0}, t2={58:0}] [L3793] 0 struct my_data *data; VAL [arg={62:40}, arg={62:40}, dev={62:40}, t1={68:0}, t2={58:0}] [L3794] 0 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, dev={62:40}, t1={68:0}, t2={58:0}] [L3792] 1 struct device *dev = (struct device*)arg; VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, dev={62:40}, t1={68:0}, t2={58:0}] [L3794] 0 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3793] 1 struct my_data *data; VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3794] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3851] -1 probe_ret = my_drv_probe(&data) VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3852] COND TRUE -1 probe_ret==0 VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3826] -1 void *status; VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3827] -1 \read(t1) VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3794] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3797] 1 data->shared.a = 1 VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3798] EXPR 1 data->shared.b VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, data->shared.b=0, dev={62:40}, t1={68:0}, t2={58:0}] [L3798] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, data->shared.b=0, dev={62:40}, t1={68:0}, t2={58:0}] [L3800] 1 return 0; VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3827] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3829] -1 data->shared.a = 3 VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3830] -1 data->shared.b = 3 VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3797] 0 data->shared.a = 1 VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3831] -1 data->shared.a VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3772] COND TRUE -1 !expression VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] [L3772] -1 __VERIFIER_error() VAL [\result={0:0}, __mptr={62:40}, arg={62:40}, arg={62:40}, data={62:0}, dev={62:40}, t1={68:0}, t2={58:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 161 locations, 6 error locations. UNSAFE Result, 40.8s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2759 SDtfs, 11376 SDslu, 13059 SDs, 0 SdLazy, 3691 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 41 SyntacticMatches, 12 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9536occurred in iteration=2, 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 40444 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 302617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...