/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:32:54,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:32:54,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:32:54,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:32:54,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:32:54,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:32:54,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:32:54,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:32:54,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:32:54,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:32:54,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:32:54,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:32:54,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:32:54,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:32:54,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:32:54,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:32:54,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:32:54,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:32:54,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:32:54,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:32:54,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:32:54,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:32:54,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:32:54,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:32:54,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:32:54,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:32:54,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:32:54,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:32:54,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:32:54,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:32:54,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:32:54,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:32:54,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:32:54,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:32:54,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:32:54,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:32:54,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:32:54,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:32:54,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:32:54,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:32:54,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:32:54,384 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:32:54,431 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:32:54,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:32:54,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:32:54,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:32:54,435 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:32:54,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:32:54,435 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:32:54,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:32:54,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:32:54,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:32:54,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:32:54,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:32:54,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:32:54,438 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:32:54,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:32:54,439 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:32:54,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:32:54,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:32:54,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:32:54,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:32:54,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:32:54,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:32:54,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:32:54,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:32:54,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:32:54,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:32:54,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:32:54,441 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:32:54,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:32:54,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:32:54,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:32:54,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:32:54,746 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:32:54,746 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:32:54,747 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-05 23:32:54,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2d98151/e406ef76fe3341b78099f981be22ccc4/FLAG88067313f [2020-10-05 23:32:55,316 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:32:55,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-05 23:32:55,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2d98151/e406ef76fe3341b78099f981be22ccc4/FLAG88067313f [2020-10-05 23:32:55,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2d98151/e406ef76fe3341b78099f981be22ccc4 [2020-10-05 23:32:55,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:32:55,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:32:55,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:32:55,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:32:55,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:32:55,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:32:55" (1/1) ... [2020-10-05 23:32:55,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3470fc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:55, skipping insertion in model container [2020-10-05 23:32:55,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:32:55" (1/1) ... [2020-10-05 23:32:55,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:32:55,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:32:56,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:32:56,307 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:32:56,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:32:56,487 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:32:56,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56 WrapperNode [2020-10-05 23:32:56,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:32:56,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:32:56,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:32:56,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:32:56,500 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:32:56" (1/1) ... [2020-10-05 23:32:56,550 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:32:56" (1/1) ... [2020-10-05 23:32:56,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:32:56,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:32:56,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:32:56,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:32:56,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (1/1) ... [2020-10-05 23:32:56,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:32:56,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:32:56,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:32:56,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:32:56,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (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:32:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:32:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:32:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:32:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:32:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:32:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:32:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:32:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:32:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:32:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:32:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:32:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:32:56,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:32:56,721 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:32:58,926 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:32:58,927 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:32:58,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:32:58 BoogieIcfgContainer [2020-10-05 23:32:58,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:32:58,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:32:58,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:32:58,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:32:58,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:32:55" (1/3) ... [2020-10-05 23:32:58,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1641c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:32:58, skipping insertion in model container [2020-10-05 23:32:58,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:56" (2/3) ... [2020-10-05 23:32:58,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1641c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:32:58, skipping insertion in model container [2020-10-05 23:32:58,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:32:58" (3/3) ... [2020-10-05 23:32:58,938 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2020-10-05 23:32:58,948 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:32:58,949 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:32:58,957 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:32:58,958 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:32:58,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,996 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,997 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:58,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,016 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,016 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:59,031 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:32:59,052 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:32:59,052 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:32:59,052 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:32:59,052 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:32:59,052 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:32:59,052 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:32:59,053 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:32:59,053 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:32:59,067 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-10-05 23:32:59,069 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-05 23:32:59,116 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-05 23:32:59,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:32:59,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-05 23:32:59,125 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-05 23:32:59,149 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-05 23:32:59,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:32:59,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-05 23:32:59,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1806 [2020-10-05 23:32:59,153 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:32:59,945 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:33:00,064 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:33:00,343 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:33:00,452 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:33:02,444 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-05 23:33:02,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-05 23:33:02,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:33:02,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:33:02,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:33:03,359 WARN L193 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-05 23:33:04,210 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-05 23:33:04,516 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-05 23:33:06,157 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-05 23:33:06,596 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-05 23:33:06,908 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-10-05 23:33:07,021 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-05 23:33:07,181 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-05 23:33:07,357 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:33:07,363 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4873 [2020-10-05 23:33:07,363 INFO L214 etLargeBlockEncoding]: Total number of compositions: 79 [2020-10-05 23:33:07,367 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-05 23:33:07,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-05 23:33:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-05 23:33:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:33:07,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:07,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:33:07,441 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1016740632, now seen corresponding path program 1 times [2020-10-05 23:33:07,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:07,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096053963] [2020-10-05 23:33:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:07,689 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:33:07,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096053963] [2020-10-05 23:33:07,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:07,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:33:07,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034328445] [2020-10-05 23:33:07,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:33:07,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:33:07,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:33:07,713 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-05 23:33:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:07,855 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-05 23:33:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:33:07,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:33:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:07,883 INFO L225 Difference]: With dead ends: 812 [2020-10-05 23:33:07,884 INFO L226 Difference]: Without dead ends: 662 [2020-10-05 23:33:07,885 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:33:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-05 23:33:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-05 23:33:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-05 23:33:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-05 23:33:08,004 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2020-10-05 23:33:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:08,004 INFO L479 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-05 23:33:08,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:33:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-05 23:33:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:33:08,006 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:08,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:08,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:33:08,007 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1534838499, now seen corresponding path program 1 times [2020-10-05 23:33:08,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:08,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049806157] [2020-10-05 23:33:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:08,123 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:33:08,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049806157] [2020-10-05 23:33:08,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:08,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:33:08,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642709599] [2020-10-05 23:33:08,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:08,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:08,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:08,127 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 4 states. [2020-10-05 23:33:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:08,178 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-05 23:33:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:08,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-05 23:33:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:08,185 INFO L225 Difference]: With dead ends: 612 [2020-10-05 23:33:08,185 INFO L226 Difference]: Without dead ends: 612 [2020-10-05 23:33:08,186 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:33:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-05 23:33:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-05 23:33:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-05 23:33:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-05 23:33:08,210 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9 [2020-10-05 23:33:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:08,212 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-05 23:33:08,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-05 23:33:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:33:08,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:08,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:08,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:33:08,215 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1839780204, now seen corresponding path program 1 times [2020-10-05 23:33:08,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:08,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856607743] [2020-10-05 23:33:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:08,346 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:33:08,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856607743] [2020-10-05 23:33:08,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:08,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:33:08,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603002706] [2020-10-05 23:33:08,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:08,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:08,348 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states. [2020-10-05 23:33:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:08,411 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-10-05 23:33:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:33:08,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:33:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:08,417 INFO L225 Difference]: With dead ends: 604 [2020-10-05 23:33:08,417 INFO L226 Difference]: Without dead ends: 604 [2020-10-05 23:33:08,418 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:33:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-05 23:33:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-05 23:33:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-05 23:33:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-10-05 23:33:08,438 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2020-10-05 23:33:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:08,439 INFO L479 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-10-05 23:33:08,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-10-05 23:33:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:33:08,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:08,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:08,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:33:08,443 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1198612647, now seen corresponding path program 1 times [2020-10-05 23:33:08,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:08,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045486791] [2020-10-05 23:33:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:08,565 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:33:08,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045486791] [2020-10-05 23:33:08,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:08,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:08,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450471775] [2020-10-05 23:33:08,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:33:08,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:33:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:08,567 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-10-05 23:33:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:08,669 INFO L93 Difference]: Finished difference Result 620 states and 1894 transitions. [2020-10-05 23:33:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:08,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:33:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:08,675 INFO L225 Difference]: With dead ends: 620 [2020-10-05 23:33:08,676 INFO L226 Difference]: Without dead ends: 620 [2020-10-05 23:33:08,676 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:33:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-10-05 23:33:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2020-10-05 23:33:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-10-05 23:33:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions. [2020-10-05 23:33:08,699 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12 [2020-10-05 23:33:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:08,700 INFO L479 AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions. [2020-10-05 23:33:08,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:33:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions. [2020-10-05 23:33:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:33:08,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:08,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:08,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:33:08,703 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 507284654, now seen corresponding path program 1 times [2020-10-05 23:33:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:08,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496027390] [2020-10-05 23:33:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:08,849 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:33:08,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496027390] [2020-10-05 23:33:08,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:08,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:08,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304689876] [2020-10-05 23:33:08,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:33:08,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:33:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:08,853 INFO L87 Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand 5 states. [2020-10-05 23:33:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:08,967 INFO L93 Difference]: Finished difference Result 618 states and 1884 transitions. [2020-10-05 23:33:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:08,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:33:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:08,973 INFO L225 Difference]: With dead ends: 618 [2020-10-05 23:33:08,973 INFO L226 Difference]: Without dead ends: 618 [2020-10-05 23:33:08,974 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:33:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-05 23:33:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608. [2020-10-05 23:33:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-10-05 23:33:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions. [2020-10-05 23:33:08,995 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13 [2020-10-05 23:33:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:08,996 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions. [2020-10-05 23:33:08,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:33:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions. [2020-10-05 23:33:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:33:08,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:08,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:08,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:33:08,999 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1454046081, now seen corresponding path program 1 times [2020-10-05 23:33:09,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:09,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384564145] [2020-10-05 23:33:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:09,136 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:33:09,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384564145] [2020-10-05 23:33:09,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:09,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:09,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785578736] [2020-10-05 23:33:09,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:09,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:09,139 INFO L87 Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand 6 states. [2020-10-05 23:33:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:09,446 INFO L93 Difference]: Finished difference Result 714 states and 2168 transitions. [2020-10-05 23:33:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:33:09,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 23:33:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:09,454 INFO L225 Difference]: With dead ends: 714 [2020-10-05 23:33:09,454 INFO L226 Difference]: Without dead ends: 714 [2020-10-05 23:33:09,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:33:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-10-05 23:33:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 696. [2020-10-05 23:33:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-10-05 23:33:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2111 transitions. [2020-10-05 23:33:09,481 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2111 transitions. Word has length 14 [2020-10-05 23:33:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:09,481 INFO L479 AbstractCegarLoop]: Abstraction has 696 states and 2111 transitions. [2020-10-05 23:33:09,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2111 transitions. [2020-10-05 23:33:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:33:09,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:09,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:09,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:33:09,484 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -815913744, now seen corresponding path program 1 times [2020-10-05 23:33:09,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:09,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711569375] [2020-10-05 23:33:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:09,610 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:33:09,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711569375] [2020-10-05 23:33:09,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:09,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:09,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69297496] [2020-10-05 23:33:09,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:09,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:09,613 INFO L87 Difference]: Start difference. First operand 696 states and 2111 transitions. Second operand 6 states. [2020-10-05 23:33:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:09,718 INFO L93 Difference]: Finished difference Result 688 states and 2083 transitions. [2020-10-05 23:33:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:09,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 23:33:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:09,725 INFO L225 Difference]: With dead ends: 688 [2020-10-05 23:33:09,725 INFO L226 Difference]: Without dead ends: 688 [2020-10-05 23:33:09,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:33:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-10-05 23:33:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2020-10-05 23:33:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-10-05 23:33:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2083 transitions. [2020-10-05 23:33:09,748 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 2083 transitions. Word has length 14 [2020-10-05 23:33:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:09,748 INFO L479 AbstractCegarLoop]: Abstraction has 688 states and 2083 transitions. [2020-10-05 23:33:09,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 2083 transitions. [2020-10-05 23:33:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:33:09,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:09,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:09,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:33:09,750 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -815576712, now seen corresponding path program 1 times [2020-10-05 23:33:09,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:09,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498003745] [2020-10-05 23:33:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:09,814 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:33:09,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498003745] [2020-10-05 23:33:09,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:09,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:09,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75403569] [2020-10-05 23:33:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:09,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:09,817 INFO L87 Difference]: Start difference. First operand 688 states and 2083 transitions. Second operand 6 states. [2020-10-05 23:33:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:09,896 INFO L93 Difference]: Finished difference Result 961 states and 2859 transitions. [2020-10-05 23:33:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:33:09,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 23:33:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:09,902 INFO L225 Difference]: With dead ends: 961 [2020-10-05 23:33:09,902 INFO L226 Difference]: Without dead ends: 664 [2020-10-05 23:33:09,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:33:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-10-05 23:33:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 634. [2020-10-05 23:33:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-10-05 23:33:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1807 transitions. [2020-10-05 23:33:09,923 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1807 transitions. Word has length 14 [2020-10-05 23:33:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:09,924 INFO L479 AbstractCegarLoop]: Abstraction has 634 states and 1807 transitions. [2020-10-05 23:33:09,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1807 transitions. [2020-10-05 23:33:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:33:09,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:09,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:09,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:33:09,926 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1074690156, now seen corresponding path program 2 times [2020-10-05 23:33:09,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:09,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058442446] [2020-10-05 23:33:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:10,012 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:33:10,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058442446] [2020-10-05 23:33:10,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:10,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:10,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745642398] [2020-10-05 23:33:10,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:10,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:10,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:10,014 INFO L87 Difference]: Start difference. First operand 634 states and 1807 transitions. Second operand 4 states. [2020-10-05 23:33:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:10,050 INFO L93 Difference]: Finished difference Result 602 states and 1516 transitions. [2020-10-05 23:33:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:33:10,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:33:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:10,054 INFO L225 Difference]: With dead ends: 602 [2020-10-05 23:33:10,054 INFO L226 Difference]: Without dead ends: 434 [2020-10-05 23:33:10,054 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:33:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-05 23:33:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-05 23:33:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-05 23:33:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1055 transitions. [2020-10-05 23:33:10,067 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1055 transitions. Word has length 14 [2020-10-05 23:33:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:10,067 INFO L479 AbstractCegarLoop]: Abstraction has 434 states and 1055 transitions. [2020-10-05 23:33:10,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1055 transitions. [2020-10-05 23:33:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:33:10,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:10,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:10,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:33:10,069 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1537330800, now seen corresponding path program 1 times [2020-10-05 23:33:10,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:10,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427018718] [2020-10-05 23:33:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:10,147 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:33:10,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427018718] [2020-10-05 23:33:10,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:10,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:10,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863894552] [2020-10-05 23:33:10,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:33:10,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:33:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:10,149 INFO L87 Difference]: Start difference. First operand 434 states and 1055 transitions. Second operand 5 states. [2020-10-05 23:33:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:10,196 INFO L93 Difference]: Finished difference Result 353 states and 800 transitions. [2020-10-05 23:33:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:33:10,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:33:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:10,199 INFO L225 Difference]: With dead ends: 353 [2020-10-05 23:33:10,199 INFO L226 Difference]: Without dead ends: 275 [2020-10-05 23:33:10,200 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:33:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-05 23:33:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 245. [2020-10-05 23:33:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-05 23:33:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 547 transitions. [2020-10-05 23:33:10,207 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 547 transitions. Word has length 15 [2020-10-05 23:33:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:10,208 INFO L479 AbstractCegarLoop]: Abstraction has 245 states and 547 transitions. [2020-10-05 23:33:10,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:33:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 547 transitions. [2020-10-05 23:33:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:33:10,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:10,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:10,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:33:10,209 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1971831814, now seen corresponding path program 1 times [2020-10-05 23:33:10,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:10,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479443221] [2020-10-05 23:33:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:10,327 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:33:10,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479443221] [2020-10-05 23:33:10,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:10,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:33:10,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332216588] [2020-10-05 23:33:10,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:10,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:10,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:10,329 INFO L87 Difference]: Start difference. First operand 245 states and 547 transitions. Second operand 6 states. [2020-10-05 23:33:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:10,392 INFO L93 Difference]: Finished difference Result 224 states and 504 transitions. [2020-10-05 23:33:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:33:10,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:33:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:10,395 INFO L225 Difference]: With dead ends: 224 [2020-10-05 23:33:10,395 INFO L226 Difference]: Without dead ends: 165 [2020-10-05 23:33:10,395 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:33:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-05 23:33:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-10-05 23:33:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-05 23:33:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 378 transitions. [2020-10-05 23:33:10,401 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 378 transitions. Word has length 18 [2020-10-05 23:33:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:10,403 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 378 transitions. [2020-10-05 23:33:10,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 378 transitions. [2020-10-05 23:33:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:33:10,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:10,405 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, 1, 1] [2020-10-05 23:33:10,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:33:10,405 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 802352378, now seen corresponding path program 1 times [2020-10-05 23:33:10,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:10,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437812723] [2020-10-05 23:33:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:10,575 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:33:10,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437812723] [2020-10-05 23:33:10,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:10,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:33:10,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872105065] [2020-10-05 23:33:10,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:33:10,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:10,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:33:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:33:10,577 INFO L87 Difference]: Start difference. First operand 165 states and 378 transitions. Second operand 9 states. [2020-10-05 23:33:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:10,791 INFO L93 Difference]: Finished difference Result 247 states and 525 transitions. [2020-10-05 23:33:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:33:10,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-05 23:33:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:10,793 INFO L225 Difference]: With dead ends: 247 [2020-10-05 23:33:10,793 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:33:10,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:33:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:33:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2020-10-05 23:33:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-05 23:33:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 178 transitions. [2020-10-05 23:33:10,798 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 178 transitions. Word has length 22 [2020-10-05 23:33:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:10,798 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 178 transitions. [2020-10-05 23:33:10,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:33:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 178 transitions. [2020-10-05 23:33:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:33:10,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:10,800 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, 1, 1] [2020-10-05 23:33:10,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:33:10,800 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -136938758, now seen corresponding path program 2 times [2020-10-05 23:33:10,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:10,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049248700] [2020-10-05 23:33:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:10,874 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:33:10,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049248700] [2020-10-05 23:33:10,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:10,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:10,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976669937] [2020-10-05 23:33:10,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:10,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:10,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:10,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:10,876 INFO L87 Difference]: Start difference. First operand 93 states and 178 transitions. Second operand 4 states. [2020-10-05 23:33:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:10,893 INFO L93 Difference]: Finished difference Result 107 states and 197 transitions. [2020-10-05 23:33:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:10,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-05 23:33:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:10,895 INFO L225 Difference]: With dead ends: 107 [2020-10-05 23:33:10,895 INFO L226 Difference]: Without dead ends: 73 [2020-10-05 23:33:10,895 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:33:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-05 23:33:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-05 23:33:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-05 23:33:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 138 transitions. [2020-10-05 23:33:10,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 138 transitions. Word has length 22 [2020-10-05 23:33:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:10,898 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 138 transitions. [2020-10-05 23:33:10,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 138 transitions. [2020-10-05 23:33:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:33:10,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:10,899 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, 1, 1] [2020-10-05 23:33:10,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:33:10,900 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1527193722, now seen corresponding path program 3 times [2020-10-05 23:33:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:10,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132489293] [2020-10-05 23:33:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:11,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:33:11,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132489293] [2020-10-05 23:33:11,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:11,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:33:11,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175718103] [2020-10-05 23:33:11,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:33:11,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:33:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:33:11,090 INFO L87 Difference]: Start difference. First operand 73 states and 138 transitions. Second operand 7 states. [2020-10-05 23:33:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:11,217 INFO L93 Difference]: Finished difference Result 99 states and 186 transitions. [2020-10-05 23:33:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:33:11,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-05 23:33:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:11,219 INFO L225 Difference]: With dead ends: 99 [2020-10-05 23:33:11,219 INFO L226 Difference]: Without dead ends: 77 [2020-10-05 23:33:11,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:33:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-05 23:33:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2020-10-05 23:33:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-05 23:33:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2020-10-05 23:33:11,225 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 22 [2020-10-05 23:33:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:11,226 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2020-10-05 23:33:11,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:33:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2020-10-05 23:33:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:33:11,226 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:11,227 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, 1, 1] [2020-10-05 23:33:11,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:33:11,227 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -258932388, now seen corresponding path program 4 times [2020-10-05 23:33:11,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:11,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617245075] [2020-10-05 23:33:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:11,638 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:33:11,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617245075] [2020-10-05 23:33:11,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:11,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:33:11,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819144913] [2020-10-05 23:33:11,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:33:11,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:33:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:33:11,640 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand 9 states. [2020-10-05 23:33:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:11,894 INFO L93 Difference]: Finished difference Result 85 states and 149 transitions. [2020-10-05 23:33:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:33:11,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-05 23:33:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:11,898 INFO L225 Difference]: With dead ends: 85 [2020-10-05 23:33:11,898 INFO L226 Difference]: Without dead ends: 51 [2020-10-05 23:33:11,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:33:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-05 23:33:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-05 23:33:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-05 23:33:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-05 23:33:11,901 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-05 23:33:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:11,901 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-05 23:33:11,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:33:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-05 23:33:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:33:11,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:11,902 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, 1, 1] [2020-10-05 23:33:11,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:33:11,902 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash 813652538, now seen corresponding path program 5 times [2020-10-05 23:33:11,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:11,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041073497] [2020-10-05 23:33:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:33:11,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:33:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:33:11,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:33:12,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:33:12,008 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:33:12,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:33:12,009 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:33:12,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L2-->L835: Formula: (let ((.cse9 (= (mod ~x$w_buff1_used~0_In1833674186 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1833674186 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In1833674186 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In1833674186 256) 0))) (let ((.cse5 (or .cse7 .cse6)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833674186 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1833674186|) (= ~x$r_buff0_thd0~0_In1833674186 ~x$r_buff0_thd0~0_Out1833674186) (or (and (= ~x$w_buff1_used~0_Out1833674186 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_Out1833674186 ~x$w_buff1_used~0_In1833674186))) (or (and (= ~x$w_buff0_used~0_Out1833674186 0) .cse3 .cse4) (and .cse5 (= ~x$w_buff0_used~0_Out1833674186 ~x$w_buff0_used~0_In1833674186))) (or (and .cse5 (or (and .cse0 .cse1 (= ~x~0_Out1833674186 ~x$w_buff1~0_In1833674186)) (and (= ~x~0_Out1833674186 ~x~0_In1833674186) .cse2))) (and (= ~x~0_Out1833674186 ~x$w_buff0~0_In1833674186) .cse3 .cse4)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833674186 0)) (= ~x$r_buff1_thd0~0_Out1833674186 ~x$r_buff1_thd0~0_In1833674186)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1833674186, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1833674186, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833674186|, ~x$w_buff1~0=~x$w_buff1~0_In1833674186, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833674186, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1833674186, ~x~0=~x~0_In1833674186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1833674186} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1833674186, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1833674186, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1833674186|, ~x$w_buff1~0=~x$w_buff1~0_In1833674186, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1833674186|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1833674186, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1833674186|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1833674186|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1833674186|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1833674186, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1833674186, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1833674186|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833674186|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1833674186, ~x~0=~x~0_Out1833674186} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:33:12,031 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:33:12,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,032 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:33:12,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,033 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:33:12,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,033 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:33:12,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,033 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:33:12,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,034 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:33:12,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,035 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:33:12,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,035 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:33:12,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,036 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:33:12,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,036 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:33:12,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,036 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:33:12,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,037 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:33:12,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,037 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:33:12,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,038 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:33:12,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,038 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:33:12,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,038 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:33:12,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,039 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:33:12,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,039 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:33:12,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,040 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:33:12,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,040 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:33:12,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,041 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:33:12,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,041 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:33:12,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,042 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:33:12,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,042 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:33:12,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,042 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:33:12,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,043 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:33:12,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,043 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:33:12,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:12,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:33:12 BasicIcfg [2020-10-05 23:33:12,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:33:12,127 INFO L168 Benchmark]: Toolchain (without parser) took 16476.88 ms. Allocated memory was 147.8 MB in the beginning and 358.6 MB in the end (delta: 210.8 MB). Free memory was 101.2 MB in the beginning and 117.9 MB in the end (delta: -16.7 MB). Peak memory consumption was 194.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,128 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 147.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.52 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 158.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.20 ms. Allocated memory is still 206.6 MB. Free memory was 158.8 MB in the beginning and 155.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,130 INFO L168 Benchmark]: Boogie Preprocessor took 40.39 ms. Allocated memory is still 206.6 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,131 INFO L168 Benchmark]: RCFGBuilder took 2304.30 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 153.0 MB in the beginning and 159.5 MB in the end (delta: -6.5 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,131 INFO L168 Benchmark]: TraceAbstraction took 13195.11 ms. Allocated memory was 244.8 MB in the beginning and 358.6 MB in the end (delta: 113.8 MB). Free memory was 157.8 MB in the beginning and 117.9 MB in the end (delta: 39.9 MB). Peak memory consumption was 153.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:12,135 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.24 ms. Allocated memory is still 147.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.52 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 158.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.20 ms. Allocated memory is still 206.6 MB. Free memory was 158.8 MB in the beginning and 155.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.39 ms. Allocated memory is still 206.6 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2304.30 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 153.0 MB in the beginning and 159.5 MB in the end (delta: -6.5 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13195.11 ms. Allocated memory was 244.8 MB in the beginning and 358.6 MB in the end (delta: 113.8 MB). Free memory was 157.8 MB in the beginning and 117.9 MB in the end (delta: 39.9 MB). Peak memory consumption was 153.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.2s, 105 ProgramPointsBefore, 37 ProgramPointsAfterwards, 97 TransitionsBefore, 27 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 926 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4873 CheckedPairsTotal, 79 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_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L711] 0 _Bool x$flush_delayed; [L712] 0 int x$mem_tmp; [L713] 0 _Bool x$r_buff0_thd0; [L714] 0 _Bool x$r_buff0_thd1; [L715] 0 _Bool x$r_buff0_thd2; [L716] 0 _Bool x$r_buff0_thd3; [L717] 0 _Bool x$r_buff1_thd0; [L718] 0 _Bool x$r_buff1_thd1; [L719] 0 _Bool x$r_buff1_thd2; [L720] 0 _Bool x$r_buff1_thd3; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L819] 0 pthread_t t1019; [L820] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] 0 pthread_t t1020; [L822] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] 0 pthread_t t1021; [L824] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L765] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L788] 3 z = 1 [L791] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L736] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 x$flush_delayed = weak$$choice2 [L840] 0 x$mem_tmp = x [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L849] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L849] 0 x = x$flush_delayed ? x$mem_tmp : x [L850] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 387 SDtfs, 556 SDslu, 835 SDs, 0 SdLazy, 482 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred 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, 15 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 32619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...