/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:40:05,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:40:05,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:40:05,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:40:05,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:40:05,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:40:05,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:40:05,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:40:05,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:40:05,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:40:05,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:40:05,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:40:05,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:40:05,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:40:05,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:40:05,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:40:05,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:40:05,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:40:05,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:40:05,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:40:05,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:40:05,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:40:05,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:40:05,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:40:05,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:40:05,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:40:05,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:40:05,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:40:05,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:40:05,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:40:05,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:40:05,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:40:05,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:40:05,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:40:05,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:40:05,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:40:05,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:40:05,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:40:05,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:40:05,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:40:05,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:40:05,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:40:05,975 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:40:05,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:40:05,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:40:05,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:40:05,979 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:40:05,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:40:05,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:40:05,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:40:05,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:40:05,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:40:05,981 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:40:05,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:40:05,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:40:05,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:40:05,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:40:05,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:40:05,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:40:05,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:40:05,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:40:05,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:40:05,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:40:05,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:40:05,985 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:40:05,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:40:06,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:40:06,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:40:06,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:40:06,292 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:40:06,293 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:40:06,294 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2020-10-05 23:40:06,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545c3e73c/bd8f72632bfd43a9a9c6a6aa4aa6464a/FLAGa7e00a56e [2020-10-05 23:40:06,875 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:40:06,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2020-10-05 23:40:06,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545c3e73c/bd8f72632bfd43a9a9c6a6aa4aa6464a/FLAGa7e00a56e [2020-10-05 23:40:07,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545c3e73c/bd8f72632bfd43a9a9c6a6aa4aa6464a [2020-10-05 23:40:07,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:40:07,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:40:07,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:07,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:40:07,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:40:07,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:07" (1/1) ... [2020-10-05 23:40:07,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1467314f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:07, skipping insertion in model container [2020-10-05 23:40:07,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:07" (1/1) ... [2020-10-05 23:40:07,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:40:07,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:40:07,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:07,907 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:40:07,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:08,059 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:40:08,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08 WrapperNode [2020-10-05 23:40:08,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:08,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:08,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:40:08,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:40:08,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:08,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:40:08,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:40:08,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:40:08,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (1/1) ... [2020-10-05 23:40:08,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:40:08,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:40:08,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:40:08,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:40:08,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (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 [2020-10-05 23:40:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:40:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:40:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:40:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:40:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:40:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:40:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:40:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:40:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:40:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:40:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:40:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:40:08,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:40:08,292 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:40:10,442 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:40:10,442 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:40:10,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:10 BoogieIcfgContainer [2020-10-05 23:40:10,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:40:10,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:40:10,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:40:10,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:40:10,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:40:07" (1/3) ... [2020-10-05 23:40:10,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1219ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:10, skipping insertion in model container [2020-10-05 23:40:10,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:08" (2/3) ... [2020-10-05 23:40:10,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1219ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:10, skipping insertion in model container [2020-10-05 23:40:10,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:10" (3/3) ... [2020-10-05 23:40:10,454 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2020-10-05 23:40:10,465 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:40:10,465 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:40:10,474 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:40:10,475 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:40:10,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,506 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:10,551 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:40:10,573 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:40:10,574 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:40:10,574 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:40:10,574 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:40:10,574 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:40:10,574 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:40:10,574 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:40:10,575 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:40:10,591 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:10,593 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:10,638 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-05 23:40:10,639 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:10,644 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:40:10,648 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:10,669 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-05 23:40:10,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:10,670 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:40:10,672 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1560 [2020-10-05 23:40:10,673 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:40:11,024 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:40:11,525 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:40:12,077 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:40:13,820 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-05 23:40:13,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:40:13,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:13,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:40:13,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:15,203 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-10-05 23:40:15,658 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-05 23:40:15,814 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-05 23:40:17,242 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-05 23:40:17,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:40:17,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:17,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:40:17,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:18,332 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2020-10-05 23:40:18,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3870 [2020-10-05 23:40:18,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-05 23:40:18,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-05 23:40:18,418 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-05 23:40:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-05 23:40:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:40:18,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:18,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:40:18,428 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-05 23:40:18,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:18,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524280477] [2020-10-05 23:40:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:18,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524280477] [2020-10-05 23:40:18,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:18,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:18,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486182324] [2020-10-05 23:40:18,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:18,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:18,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:18,700 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-05 23:40:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:18,810 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-05 23:40:18,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:18,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:40:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:18,834 INFO L225 Difference]: With dead ends: 552 [2020-10-05 23:40:18,835 INFO L226 Difference]: Without dead ends: 452 [2020-10-05 23:40:18,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-05 23:40:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-05 23:40:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 23:40:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-05 23:40:18,940 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-05 23:40:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:18,940 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-05 23:40:18,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-05 23:40:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:40:18,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:18,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:18,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:40:18,943 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-05 23:40:18,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:18,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863385702] [2020-10-05 23:40:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:19,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863385702] [2020-10-05 23:40:19,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:19,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:19,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277787102] [2020-10-05 23:40:19,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:19,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:19,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,068 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-05 23:40:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:19,086 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-10-05 23:40:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:19,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:40:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:19,092 INFO L225 Difference]: With dead ends: 442 [2020-10-05 23:40:19,093 INFO L226 Difference]: Without dead ends: 442 [2020-10-05 23:40:19,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-05 23:40:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-05 23:40:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-05 23:40:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-10-05 23:40:19,133 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9 [2020-10-05 23:40:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:19,134 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-10-05 23:40:19,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-10-05 23:40:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:40:19,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:19,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:19,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:40:19,140 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-05 23:40:19,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:19,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058640618] [2020-10-05 23:40:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:19,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058640618] [2020-10-05 23:40:19,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:19,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:19,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110322138] [2020-10-05 23:40:19,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:19,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,295 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-10-05 23:40:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:19,325 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-10-05 23:40:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:19,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:40:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:19,330 INFO L225 Difference]: With dead ends: 424 [2020-10-05 23:40:19,331 INFO L226 Difference]: Without dead ends: 424 [2020-10-05 23:40:19,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-05 23:40:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-10-05 23:40:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-05 23:40:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-10-05 23:40:19,354 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 10 [2020-10-05 23:40:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:19,355 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-10-05 23:40:19,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-10-05 23:40:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:40:19,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:19,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:19,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:40:19,358 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times [2020-10-05 23:40:19,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:19,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790051464] [2020-10-05 23:40:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:19,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790051464] [2020-10-05 23:40:19,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:19,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:19,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410037692] [2020-10-05 23:40:19,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:19,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:19,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:19,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,466 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 3 states. [2020-10-05 23:40:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:19,531 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-10-05 23:40:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:19,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:40:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:19,542 INFO L225 Difference]: With dead ends: 421 [2020-10-05 23:40:19,542 INFO L226 Difference]: Without dead ends: 421 [2020-10-05 23:40:19,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-05 23:40:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-05 23:40:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-05 23:40:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-10-05 23:40:19,562 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-10-05 23:40:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:19,563 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-10-05 23:40:19,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-10-05 23:40:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:19,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:19,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:19,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:40:19,573 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1277010548, now seen corresponding path program 1 times [2020-10-05 23:40:19,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:19,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629408032] [2020-10-05 23:40:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:19,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629408032] [2020-10-05 23:40:19,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:19,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:19,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124250333] [2020-10-05 23:40:19,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:19,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:19,749 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 6 states. [2020-10-05 23:40:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:19,900 INFO L93 Difference]: Finished difference Result 458 states and 1362 transitions. [2020-10-05 23:40:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:19,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-05 23:40:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:19,905 INFO L225 Difference]: With dead ends: 458 [2020-10-05 23:40:19,905 INFO L226 Difference]: Without dead ends: 458 [2020-10-05 23:40:19,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-05 23:40:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2020-10-05 23:40:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-05 23:40:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1334 transitions. [2020-10-05 23:40:19,923 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1334 transitions. Word has length 12 [2020-10-05 23:40:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:19,923 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1334 transitions. [2020-10-05 23:40:19,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1334 transitions. [2020-10-05 23:40:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:19,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:19,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:19,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:40:19,925 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times [2020-10-05 23:40:19,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:19,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349464629] [2020-10-05 23:40:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:19,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349464629] [2020-10-05 23:40:19,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:19,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:40:19,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677091445] [2020-10-05 23:40:19,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:19,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:19,984 INFO L87 Difference]: Start difference. First operand 450 states and 1334 transitions. Second operand 4 states. [2020-10-05 23:40:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:20,054 INFO L93 Difference]: Finished difference Result 458 states and 1359 transitions. [2020-10-05 23:40:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:20,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 23:40:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:20,059 INFO L225 Difference]: With dead ends: 458 [2020-10-05 23:40:20,060 INFO L226 Difference]: Without dead ends: 458 [2020-10-05 23:40:20,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-05 23:40:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 454. [2020-10-05 23:40:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-10-05 23:40:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1345 transitions. [2020-10-05 23:40:20,074 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1345 transitions. Word has length 12 [2020-10-05 23:40:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:20,075 INFO L479 AbstractCegarLoop]: Abstraction has 454 states and 1345 transitions. [2020-10-05 23:40:20,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1345 transitions. [2020-10-05 23:40:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:20,076 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:20,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:20,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:40:20,077 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times [2020-10-05 23:40:20,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:20,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082455904] [2020-10-05 23:40:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:20,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082455904] [2020-10-05 23:40:20,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:20,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:20,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044298169] [2020-10-05 23:40:20,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:20,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:20,170 INFO L87 Difference]: Start difference. First operand 454 states and 1345 transitions. Second operand 5 states. [2020-10-05 23:40:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:20,263 INFO L93 Difference]: Finished difference Result 508 states and 1500 transitions. [2020-10-05 23:40:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:20,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:40:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:20,268 INFO L225 Difference]: With dead ends: 508 [2020-10-05 23:40:20,269 INFO L226 Difference]: Without dead ends: 508 [2020-10-05 23:40:20,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-10-05 23:40:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498. [2020-10-05 23:40:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-10-05 23:40:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1470 transitions. [2020-10-05 23:40:20,286 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1470 transitions. Word has length 12 [2020-10-05 23:40:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:20,287 INFO L479 AbstractCegarLoop]: Abstraction has 498 states and 1470 transitions. [2020-10-05 23:40:20,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1470 transitions. [2020-10-05 23:40:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:20,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:20,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:20,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:40:20,289 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1902226268, now seen corresponding path program 1 times [2020-10-05 23:40:20,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:20,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215149790] [2020-10-05 23:40:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:20,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215149790] [2020-10-05 23:40:20,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:20,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:20,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228372160] [2020-10-05 23:40:20,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:20,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:20,386 INFO L87 Difference]: Start difference. First operand 498 states and 1470 transitions. Second operand 5 states. [2020-10-05 23:40:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:20,423 INFO L93 Difference]: Finished difference Result 677 states and 1935 transitions. [2020-10-05 23:40:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:20,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:40:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:20,428 INFO L225 Difference]: With dead ends: 677 [2020-10-05 23:40:20,428 INFO L226 Difference]: Without dead ends: 460 [2020-10-05 23:40:20,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-05 23:40:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 430. [2020-10-05 23:40:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-05 23:40:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1183 transitions. [2020-10-05 23:40:20,446 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1183 transitions. Word has length 13 [2020-10-05 23:40:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:20,446 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1183 transitions. [2020-10-05 23:40:20,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1183 transitions. [2020-10-05 23:40:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:20,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:20,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:20,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:40:20,448 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times [2020-10-05 23:40:20,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:20,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893891011] [2020-10-05 23:40:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:20,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893891011] [2020-10-05 23:40:20,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:20,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:20,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643787808] [2020-10-05 23:40:20,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:20,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:20,631 INFO L87 Difference]: Start difference. First operand 430 states and 1183 transitions. Second operand 6 states. [2020-10-05 23:40:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:20,719 INFO L93 Difference]: Finished difference Result 450 states and 1227 transitions. [2020-10-05 23:40:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:20,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-05 23:40:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:20,725 INFO L225 Difference]: With dead ends: 450 [2020-10-05 23:40:20,725 INFO L226 Difference]: Without dead ends: 450 [2020-10-05 23:40:20,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-05 23:40:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2020-10-05 23:40:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-05 23:40:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1156 transitions. [2020-10-05 23:40:20,739 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1156 transitions. Word has length 13 [2020-10-05 23:40:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:20,740 INFO L479 AbstractCegarLoop]: Abstraction has 416 states and 1156 transitions. [2020-10-05 23:40:20,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1156 transitions. [2020-10-05 23:40:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:40:20,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:20,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:20,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:40:20,742 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times [2020-10-05 23:40:20,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:20,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152451966] [2020-10-05 23:40:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:20,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152451966] [2020-10-05 23:40:20,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:20,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:20,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145961806] [2020-10-05 23:40:20,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:20,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:20,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:20,851 INFO L87 Difference]: Start difference. First operand 416 states and 1156 transitions. Second operand 4 states. [2020-10-05 23:40:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:20,886 INFO L93 Difference]: Finished difference Result 406 states and 995 transitions. [2020-10-05 23:40:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:20,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:40:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:20,889 INFO L225 Difference]: With dead ends: 406 [2020-10-05 23:40:20,890 INFO L226 Difference]: Without dead ends: 298 [2020-10-05 23:40:20,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-05 23:40:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-10-05 23:40:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-10-05 23:40:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 708 transitions. [2020-10-05 23:40:20,903 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 708 transitions. Word has length 14 [2020-10-05 23:40:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:20,904 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 708 transitions. [2020-10-05 23:40:20,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 708 transitions. [2020-10-05 23:40:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:40:20,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:20,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:20,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:40:20,906 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times [2020-10-05 23:40:20,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:20,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111662698] [2020-10-05 23:40:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:20,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111662698] [2020-10-05 23:40:20,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:20,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:20,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038841069] [2020-10-05 23:40:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:20,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:20,992 INFO L87 Difference]: Start difference. First operand 298 states and 708 transitions. Second operand 5 states. [2020-10-05 23:40:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:21,043 INFO L93 Difference]: Finished difference Result 246 states and 538 transitions. [2020-10-05 23:40:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:21,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:40:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:21,045 INFO L225 Difference]: With dead ends: 246 [2020-10-05 23:40:21,046 INFO L226 Difference]: Without dead ends: 191 [2020-10-05 23:40:21,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-05 23:40:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2020-10-05 23:40:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-05 23:40:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 381 transitions. [2020-10-05 23:40:21,052 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 381 transitions. Word has length 15 [2020-10-05 23:40:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:21,052 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 381 transitions. [2020-10-05 23:40:21,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 381 transitions. [2020-10-05 23:40:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:40:21,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:21,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:21,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:40:21,054 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times [2020-10-05 23:40:21,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:21,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546082739] [2020-10-05 23:40:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:21,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546082739] [2020-10-05 23:40:21,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:21,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:21,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182084274] [2020-10-05 23:40:21,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:21,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:21,154 INFO L87 Difference]: Start difference. First operand 179 states and 381 transitions. Second operand 6 states. [2020-10-05 23:40:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:21,219 INFO L93 Difference]: Finished difference Result 162 states and 346 transitions. [2020-10-05 23:40:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:21,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:40:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:21,222 INFO L225 Difference]: With dead ends: 162 [2020-10-05 23:40:21,222 INFO L226 Difference]: Without dead ends: 113 [2020-10-05 23:40:21,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-05 23:40:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-05 23:40:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-05 23:40:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions. [2020-10-05 23:40:21,229 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17 [2020-10-05 23:40:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:21,230 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 240 transitions. [2020-10-05 23:40:21,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions. [2020-10-05 23:40:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:21,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:21,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:21,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:40:21,232 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times [2020-10-05 23:40:21,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:21,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581113849] [2020-10-05 23:40:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:21,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581113849] [2020-10-05 23:40:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:21,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:21,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811765012] [2020-10-05 23:40:21,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:40:21,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:40:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:21,529 INFO L87 Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 7 states. [2020-10-05 23:40:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:21,698 INFO L93 Difference]: Finished difference Result 145 states and 301 transitions. [2020-10-05 23:40:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:21,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 23:40:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:21,701 INFO L225 Difference]: With dead ends: 145 [2020-10-05 23:40:21,701 INFO L226 Difference]: Without dead ends: 115 [2020-10-05 23:40:21,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:40:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-05 23:40:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-05 23:40:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-05 23:40:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 192 transitions. [2020-10-05 23:40:21,706 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 192 transitions. Word has length 20 [2020-10-05 23:40:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:21,706 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 192 transitions. [2020-10-05 23:40:21,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:40:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2020-10-05 23:40:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:21,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:21,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:21,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:40:21,708 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times [2020-10-05 23:40:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:21,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348583423] [2020-10-05 23:40:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:22,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348583423] [2020-10-05 23:40:22,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:22,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:40:22,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513510327] [2020-10-05 23:40:22,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:40:22,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:40:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:22,091 INFO L87 Difference]: Start difference. First operand 97 states and 192 transitions. Second operand 8 states. [2020-10-05 23:40:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:22,325 INFO L93 Difference]: Finished difference Result 123 states and 240 transitions. [2020-10-05 23:40:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:22,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-05 23:40:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:22,327 INFO L225 Difference]: With dead ends: 123 [2020-10-05 23:40:22,327 INFO L226 Difference]: Without dead ends: 77 [2020-10-05 23:40:22,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:40:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-05 23:40:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-05 23:40:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-05 23:40:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions. [2020-10-05 23:40:22,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20 [2020-10-05 23:40:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:22,331 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 144 transitions. [2020-10-05 23:40:22,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:40:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2020-10-05 23:40:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:22,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:22,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:22,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:40:22,333 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times [2020-10-05 23:40:22,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:22,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163574090] [2020-10-05 23:40:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:40:22,381 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:40:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:40:22,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:40:22,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:40:22,453 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:40:22,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:40:22,455 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:40:22,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse8 (= (mod ~y$r_buff1_thd0~0_In-1673256589 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1673256589 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1673256589 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1673256589 256) 0))) (let ((.cse5 (or .cse7 .cse6)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In-1673256589 ~y$r_buff0_thd0~0_Out-1673256589) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1673256589 0)) (or (and (= ~y$w_buff1_used~0_Out-1673256589 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff1_used~0_In-1673256589 ~y$w_buff1_used~0_Out-1673256589))) (= ~y$r_buff1_thd0~0_Out-1673256589 ~y$r_buff1_thd0~0_In-1673256589) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-1673256589 0)) (and (= ~y$w_buff0_used~0_Out-1673256589 ~y$w_buff0_used~0_In-1673256589) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1673256589 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1673256589|) (or (and .cse5 (or (and (= ~y$w_buff1~0_In-1673256589 ~y~0_Out-1673256589) .cse0 .cse1) (and (= ~y~0_Out-1673256589 ~y~0_In-1673256589) .cse2))) (and .cse3 (= ~y$w_buff0~0_In-1673256589 ~y~0_Out-1673256589) .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1673256589|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1673256589, ~y$w_buff1~0=~y$w_buff1~0_In-1673256589, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1673256589, ~y$w_buff0~0=~y$w_buff0~0_In-1673256589, ~y~0=~y~0_In-1673256589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1673256589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1673256589} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1673256589|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1673256589, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1673256589|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1673256589|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1673256589|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1673256589|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1673256589|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1673256589|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1673256589, ~y$w_buff1~0=~y$w_buff1~0_In-1673256589, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1673256589, ~y$w_buff0~0=~y$w_buff0~0_In-1673256589, ~y~0=~y~0_Out-1673256589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1673256589, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1673256589} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:40:22,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:22,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:22,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:40:22 BasicIcfg [2020-10-05 23:40:22,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:40:22,569 INFO L168 Benchmark]: Toolchain (without parser) took 15373.21 ms. Allocated memory was 141.6 MB in the beginning and 347.6 MB in the end (delta: 206.0 MB). Free memory was 103.1 MB in the beginning and 130.2 MB in the end (delta: -27.1 MB). Peak memory consumption was 178.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,570 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.84 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 102.9 MB in the beginning and 155.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.82 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,574 INFO L168 Benchmark]: Boogie Preprocessor took 79.48 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,575 INFO L168 Benchmark]: RCFGBuilder took 2225.79 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 150.6 MB in the beginning and 158.8 MB in the end (delta: -8.1 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,580 INFO L168 Benchmark]: TraceAbstraction took 12121.38 ms. Allocated memory was 244.8 MB in the beginning and 347.6 MB in the end (delta: 102.8 MB). Free memory was 158.8 MB in the beginning and 130.2 MB in the end (delta: 28.5 MB). Peak memory consumption was 131.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:22,587 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.84 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 102.9 MB in the beginning and 155.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.82 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.48 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2225.79 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 150.6 MB in the beginning and 158.8 MB in the end (delta: -8.1 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12121.38 ms. Allocated memory was 244.8 MB in the beginning and 347.6 MB in the end (delta: 102.8 MB). Free memory was 158.8 MB in the beginning and 130.2 MB in the end (delta: 28.5 MB). Peak memory consumption was 131.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 98 ProgramPointsBefore, 35 ProgramPointsAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3870 CheckedPairsTotal, 76 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2192; [L803] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2193; [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L806] 0 pthread_t t2194; [L807] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 278 SDtfs, 334 SDslu, 446 SDs, 0 SdLazy, 332 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 28441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...