/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:57:51,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:57:51,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:57:51,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:57:51,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:57:51,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:57:51,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:57:51,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:57:51,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:57:51,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:57:51,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:57:51,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:57:51,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:57:51,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:57:51,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:57:51,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:57:51,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:57:51,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:57:51,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:57:51,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:57:51,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:57:51,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:57:51,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:57:51,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:57:51,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:57:51,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:57:51,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:57:51,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:57:51,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:57:51,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:57:51,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:57:51,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:57:51,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:57:51,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:57:51,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:57:51,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:57:51,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:57:51,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:57:51,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:57:51,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:57:51,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:57:51,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 19:57:51,960 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:57:51,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:57:51,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:57:51,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:57:51,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:57:51,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:57:51,964 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:57:51,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:57:51,965 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:57:51,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:57:51,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:57:51,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:57:51,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:57:51,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:57:51,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:57:51,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 19:57:52,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:57:52,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:57:52,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:57:52,299 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:57:52,299 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:57:52,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-06-05 19:57:52,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388de7023/837978c2b9b34d45a5b47ba512dbfa23/FLAG77c83c734 [2021-06-05 19:57:52,924 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:57:52,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-06-05 19:57:52,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388de7023/837978c2b9b34d45a5b47ba512dbfa23/FLAG77c83c734 [2021-06-05 19:57:53,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388de7023/837978c2b9b34d45a5b47ba512dbfa23 [2021-06-05 19:57:53,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:57:53,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:57:53,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:57:53,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:57:53,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:57:53,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7865a693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53, skipping insertion in model container [2021-06-05 19:57:53,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:57:53,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:57:53,545 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-06-05 19:57:53,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:57:53,778 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:57:53,788 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-06-05 19:57:53,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:57:53,876 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:57:53,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53 WrapperNode [2021-06-05 19:57:53,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:57:53,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:57:53,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:57:53,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:57:53,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:57:53,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:57:53,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:57:53,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:57:53,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (1/1) ... [2021-06-05 19:57:53,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:57:53,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:57:53,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:57:53,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:57:53,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (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 [2021-06-05 19:57:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:57:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:57:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:57:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:57:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:57:54,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:57:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:57:54,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:57:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:57:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:57:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:57:54,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:57:54,057 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 19:57:55,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:57:55,778 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:57:55,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:57:55 BoogieIcfgContainer [2021-06-05 19:57:55,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:57:55,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:57:55,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:57:55,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:57:55,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:57:53" (1/3) ... [2021-06-05 19:57:55,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53841d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:57:55, skipping insertion in model container [2021-06-05 19:57:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:53" (2/3) ... [2021-06-05 19:57:55,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53841d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:57:55, skipping insertion in model container [2021-06-05 19:57:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:57:55" (3/3) ... [2021-06-05 19:57:55,787 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-06-05 19:57:55,793 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:57:55,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:57:55,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:57:55,794 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:57:55,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:55,841 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:57:55,859 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:57:55,882 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:57:55,882 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:57:55,882 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:57:55,882 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:57:55,883 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:57:55,883 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:57:55,884 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:57:55,884 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-05 19:57:55,899 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:57:55,992 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:57:56,028 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-05 19:57:56,030 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 19:57:56,032 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:57:56,032 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:57:56,032 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:57:56,032 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:57:56,032 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:57:56,032 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:57:56,032 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:57:56,032 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:57:56,034 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:57:56,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-06-05 19:57:56,076 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:56,077 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:56,077 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-06-05 19:57:56,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:56,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998270250] [2021-06-05 19:57:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:56,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:56,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998270250] [2021-06-05 19:57:56,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998270250] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:56,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:56,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:57:56,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705238070] [2021-06-05 19:57:56,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:57:56,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:57:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:57:56,566 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:56,748 INFO L93 Difference]: Finished difference Result 2578 states and 6846 transitions. [2021-06-05 19:57:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:57:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-06-05 19:57:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:56,767 INFO L225 Difference]: With dead ends: 2578 [2021-06-05 19:57:56,767 INFO L226 Difference]: Without dead ends: 1130 [2021-06-05 19:57:56,768 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-06-05 19:57:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2021-06-05 19:57:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1128 states have (on average 2.5913120567375887) internal successors, (2923), 1129 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2923 transitions. [2021-06-05 19:57:56,852 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2923 transitions. Word has length 56 [2021-06-05 19:57:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:56,853 INFO L482 AbstractCegarLoop]: Abstraction has 1130 states and 2923 transitions. [2021-06-05 19:57:56,853 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2923 transitions. [2021-06-05 19:57:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 19:57:56,856 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:56,856 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:56,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:57:56,856 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1550290026, now seen corresponding path program 1 times [2021-06-05 19:57:56,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:56,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317519972] [2021-06-05 19:57:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:57,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:57,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317519972] [2021-06-05 19:57:57,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317519972] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:57,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:57,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:57:57,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537856902] [2021-06-05 19:57:57,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:57:57,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:57,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:57:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:57:57,171 INFO L87 Difference]: Start difference. First operand 1130 states and 2923 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:57,522 INFO L93 Difference]: Finished difference Result 1344 states and 3440 transitions. [2021-06-05 19:57:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:57:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 19:57:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:57,529 INFO L225 Difference]: With dead ends: 1344 [2021-06-05 19:57:57,530 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 19:57:57,531 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 238.1ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:57:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 19:57:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2021-06-05 19:57:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1086 states have (on average 2.5755064456721914) internal successors, (2797), 1087 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2797 transitions. [2021-06-05 19:57:57,573 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2797 transitions. Word has length 58 [2021-06-05 19:57:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:57,574 INFO L482 AbstractCegarLoop]: Abstraction has 1088 states and 2797 transitions. [2021-06-05 19:57:57,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2797 transitions. [2021-06-05 19:57:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 19:57:57,578 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:57,578 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:57,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:57:57,579 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1756957986, now seen corresponding path program 1 times [2021-06-05 19:57:57,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:57,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624726142] [2021-06-05 19:57:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:57,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:57,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624726142] [2021-06-05 19:57:57,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624726142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:57,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:57,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:57:57,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108708519] [2021-06-05 19:57:57,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:57:57,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:57:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:57:57,808 INFO L87 Difference]: Start difference. First operand 1088 states and 2797 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:58,286 INFO L93 Difference]: Finished difference Result 1191 states and 3021 transitions. [2021-06-05 19:57:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 19:57:58,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 19:57:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:58,298 INFO L225 Difference]: With dead ends: 1191 [2021-06-05 19:57:58,298 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 19:57:58,299 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 349.9ms TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2021-06-05 19:57:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 19:57:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 991. [2021-06-05 19:57:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 2.5484848484848484) internal successors, (2523), 990 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2523 transitions. [2021-06-05 19:57:58,323 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2523 transitions. Word has length 59 [2021-06-05 19:57:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:58,324 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 2523 transitions. [2021-06-05 19:57:58,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2523 transitions. [2021-06-05 19:57:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 19:57:58,326 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:58,326 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:58,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:57:58,326 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 696872629, now seen corresponding path program 1 times [2021-06-05 19:57:58,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:58,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513401154] [2021-06-05 19:57:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:58,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:58,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513401154] [2021-06-05 19:57:58,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513401154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:58,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:58,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 19:57:58,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126989293] [2021-06-05 19:57:58,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 19:57:58,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 19:57:58,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-06-05 19:57:58,532 INFO L87 Difference]: Start difference. First operand 991 states and 2523 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:58,921 INFO L93 Difference]: Finished difference Result 1167 states and 2963 transitions. [2021-06-05 19:57:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 19:57:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 19:57:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:58,926 INFO L225 Difference]: With dead ends: 1167 [2021-06-05 19:57:58,926 INFO L226 Difference]: Without dead ends: 1039 [2021-06-05 19:57:58,926 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 285.6ms TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2021-06-05 19:57:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-06-05 19:57:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1015. [2021-06-05 19:57:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 2.5453648915187377) internal successors, (2581), 1014 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2581 transitions. [2021-06-05 19:57:58,950 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 2581 transitions. Word has length 60 [2021-06-05 19:57:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:58,950 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 2581 transitions. [2021-06-05 19:57:58,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2581 transitions. [2021-06-05 19:57:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 19:57:58,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:58,952 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:58,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:57:58,953 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:58,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:58,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1303999016, now seen corresponding path program 1 times [2021-06-05 19:57:58,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:58,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855488113] [2021-06-05 19:57:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:59,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:59,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855488113] [2021-06-05 19:57:59,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855488113] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:59,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:59,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:57:59,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400615307] [2021-06-05 19:57:59,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:57:59,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:57:59,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:57:59,041 INFO L87 Difference]: Start difference. First operand 1015 states and 2581 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:59,136 INFO L93 Difference]: Finished difference Result 1633 states and 4115 transitions. [2021-06-05 19:57:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:57:59,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 19:57:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:59,141 INFO L225 Difference]: With dead ends: 1633 [2021-06-05 19:57:59,141 INFO L226 Difference]: Without dead ends: 943 [2021-06-05 19:57:59,141 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-06-05 19:57:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2021-06-05 19:57:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.429440389294404) internal successors, (1997), 822 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1997 transitions. [2021-06-05 19:57:59,161 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1997 transitions. Word has length 60 [2021-06-05 19:57:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:59,161 INFO L482 AbstractCegarLoop]: Abstraction has 823 states and 1997 transitions. [2021-06-05 19:57:59,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1997 transitions. [2021-06-05 19:57:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:57:59,163 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:59,163 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:59,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:57:59,163 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029783, now seen corresponding path program 1 times [2021-06-05 19:57:59,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:59,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653525126] [2021-06-05 19:57:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:59,468 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:59,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653525126] [2021-06-05 19:57:59,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653525126] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:59,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:59,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 19:57:59,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787452875] [2021-06-05 19:57:59,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 19:57:59,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 19:57:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:57:59,470 INFO L87 Difference]: Start difference. First operand 823 states and 1997 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:00,090 INFO L93 Difference]: Finished difference Result 966 states and 2303 transitions. [2021-06-05 19:58:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 19:58:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:58:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:00,094 INFO L225 Difference]: With dead ends: 966 [2021-06-05 19:58:00,094 INFO L226 Difference]: Without dead ends: 805 [2021-06-05 19:58:00,095 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 540.4ms TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2021-06-05 19:58:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-06-05 19:58:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2021-06-05 19:58:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.4191542288557213) internal successors, (1945), 804 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1945 transitions. [2021-06-05 19:58:00,136 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1945 transitions. Word has length 62 [2021-06-05 19:58:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:00,136 INFO L482 AbstractCegarLoop]: Abstraction has 805 states and 1945 transitions. [2021-06-05 19:58:00,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1945 transitions. [2021-06-05 19:58:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:58:00,138 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:00,138 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:00,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:58:00,138 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 695919513, now seen corresponding path program 2 times [2021-06-05 19:58:00,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:00,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588779607] [2021-06-05 19:58:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:00,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:00,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588779607] [2021-06-05 19:58:00,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588779607] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:00,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:00,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:58:00,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063109403] [2021-06-05 19:58:00,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:58:00,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:00,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:58:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:58:00,418 INFO L87 Difference]: Start difference. First operand 805 states and 1945 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:00,904 INFO L93 Difference]: Finished difference Result 1181 states and 2835 transitions. [2021-06-05 19:58:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:58:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:58:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:00,908 INFO L225 Difference]: With dead ends: 1181 [2021-06-05 19:58:00,909 INFO L226 Difference]: Without dead ends: 769 [2021-06-05 19:58:00,909 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 509.1ms TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:58:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2021-06-05 19:58:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 649. [2021-06-05 19:58:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.3580246913580245) internal successors, (1528), 648 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1528 transitions. [2021-06-05 19:58:00,928 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1528 transitions. Word has length 62 [2021-06-05 19:58:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:00,928 INFO L482 AbstractCegarLoop]: Abstraction has 649 states and 1528 transitions. [2021-06-05 19:58:00,928 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1528 transitions. [2021-06-05 19:58:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:58:00,930 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:00,930 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:00,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:58:00,930 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash -80791419, now seen corresponding path program 1 times [2021-06-05 19:58:00,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:00,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153418016] [2021-06-05 19:58:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:01,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:01,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153418016] [2021-06-05 19:58:01,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153418016] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:01,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:01,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:01,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481785550] [2021-06-05 19:58:01,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:01,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:01,034 INFO L87 Difference]: Start difference. First operand 649 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:01,118 INFO L93 Difference]: Finished difference Result 719 states and 1652 transitions. [2021-06-05 19:58:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:58:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:01,121 INFO L225 Difference]: With dead ends: 719 [2021-06-05 19:58:01,121 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 19:58:01,121 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 78.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 19:58:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2021-06-05 19:58:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions. [2021-06-05 19:58:01,138 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62 [2021-06-05 19:58:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:01,138 INFO L482 AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions. [2021-06-05 19:58:01,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions. [2021-06-05 19:58:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 19:58:01,146 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:01,146 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:01,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:58:01,146 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -615861270, now seen corresponding path program 1 times [2021-06-05 19:58:01,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:01,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92399369] [2021-06-05 19:58:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:01,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:01,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92399369] [2021-06-05 19:58:01,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92399369] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:01,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:01,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:58:01,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562309109] [2021-06-05 19:58:01,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:58:01,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:58:01,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:58:01,262 INFO L87 Difference]: Start difference. First operand 535 states and 1210 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:01,356 INFO L93 Difference]: Finished difference Result 457 states and 987 transitions. [2021-06-05 19:58:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:58:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 19:58:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:01,357 INFO L225 Difference]: With dead ends: 457 [2021-06-05 19:58:01,357 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 19:58:01,360 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:58:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 19:58:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-06-05 19:58:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions. [2021-06-05 19:58:01,365 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63 [2021-06-05 19:58:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:01,365 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 560 transitions. [2021-06-05 19:58:01,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions. [2021-06-05 19:58:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 19:58:01,371 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:01,371 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:01,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:58:01,371 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1463907637, now seen corresponding path program 1 times [2021-06-05 19:58:01,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:01,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573812191] [2021-06-05 19:58:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:58:01,437 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:58:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:58:01,494 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:58:01,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:58:01,539 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:58:01,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:58:01,539 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 19:58:01,542 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:58:01,543 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:58:01,543 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:58:01,543 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:58:01,543 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:58:01,544 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:58:01,544 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:58:01,544 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:58:01,544 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork1======== [2021-06-05 19:58:01,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:58:01,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 19:58:01,585 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:01,585 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:01,585 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:01,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-06-05 19:58:01,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:01,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148250766] [2021-06-05 19:58:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:01,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:01,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148250766] [2021-06-05 19:58:01,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148250766] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:01,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:01,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:58:01,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602301148] [2021-06-05 19:58:01,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:58:01,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:58:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:01,612 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:01,642 INFO L93 Difference]: Finished difference Result 1627 states and 4300 transitions. [2021-06-05 19:58:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:58:01,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 19:58:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:01,644 INFO L225 Difference]: With dead ends: 1627 [2021-06-05 19:58:01,644 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:58:01,644 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:58:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:58:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:58:01,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-06-05 19:58:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:01,645 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:58:01,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:58:01,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:58:01,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:58:01,646 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork1 was SAFE (3/3) [2021-06-05 19:58:01,646 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:58:01,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:58:01 BasicIcfg [2021-06-05 19:58:01,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:58:01,753 INFO L168 Benchmark]: Toolchain (without parser) took 8378.97 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 322.9 MB in the beginning and 336.6 MB in the end (delta: -13.7 MB). Peak memory consumption was 61.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,753 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 360.7 MB. Free memory was 341.6 MB in the beginning and 341.5 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:58:01,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.65 ms. Allocated memory is still 360.7 MB. Free memory was 322.7 MB in the beginning and 321.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 360.7 MB. Free memory was 321.1 MB in the beginning and 317.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,757 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 ms. Allocated memory is still 360.7 MB. Free memory was 317.9 MB in the beginning and 315.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,758 INFO L168 Benchmark]: RCFGBuilder took 1804.01 ms. Allocated memory is still 360.7 MB. Free memory was 315.8 MB in the beginning and 322.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 193.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,759 INFO L168 Benchmark]: TraceAbstraction took 5969.04 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 321.9 MB in the beginning and 336.6 MB in the end (delta: -14.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:01,765 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 360.7 MB. Free memory was 341.6 MB in the beginning and 341.5 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 502.65 ms. Allocated memory is still 360.7 MB. Free memory was 322.7 MB in the beginning and 321.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 360.7 MB. Free memory was 321.1 MB in the beginning and 317.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.54 ms. Allocated memory is still 360.7 MB. Free memory was 317.9 MB in the beginning and 315.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1804.01 ms. Allocated memory is still 360.7 MB. Free memory was 315.8 MB in the beginning and 322.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 193.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5969.04 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 321.9 MB in the beginning and 336.6 MB in the end (delta: -14.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 148.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 34.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 109.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5507.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 27.3ms, AutomataDifference: 2875.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 36.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 942 SDtfs, 1817 SDslu, 3935 SDs, 0 SdLazy, 787 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 774.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2275.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 261.5ms AutomataMinimizationTime, 9 MinimizatonAttempts, 288 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.6ms SsaConstructionTime, 470.3ms SatisfiabilityAnalysisTime, 1476.5ms InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 3270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 102.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 2.6ms, AutomataDifference: 35.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 34 SDslu, 61 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 5.3ms SatisfiabilityAnalysisTime, 13.0ms InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...