/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:34:56,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:34:56,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:34:56,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:34:56,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:34:56,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:34:56,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:34:56,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:34:56,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:34:56,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:34:56,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:34:56,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:34:56,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:34:56,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:34:56,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:34:56,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:34:56,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:34:56,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:34:56,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:34:56,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:34:56,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:34:56,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:34:56,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:34:56,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:34:56,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:34:56,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:34:56,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:34:56,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:34:56,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:34:56,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:34:56,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:34:56,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:34:56,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:34:56,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:34:56,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:34:56,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:34:56,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:34:56,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:34:56,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:34:56,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:34:56,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:34:56,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:34:56,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:34:56,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:34:56,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:34:56,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:34:56,934 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:34:56,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:34:56,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:34:56,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:34:56,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:34:56,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:34:56,936 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:34:56,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:34:56,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:34:56,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:34:56,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:34:56,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:34:56,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:34:56,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:34:56,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:34:56,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:34:56,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:34:56,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:34:56,939 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:34:56,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:34:57,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:34:57,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:34:57,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:34:57,229 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:34:57,229 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:34:57,230 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-05 23:34:57,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed42478/30b8ea12c20340db9fe8e8e973dbdbd0/FLAG9ba607ae9 [2020-10-05 23:34:57,893 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:34:57,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-05 23:34:57,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed42478/30b8ea12c20340db9fe8e8e973dbdbd0/FLAG9ba607ae9 [2020-10-05 23:34:58,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed42478/30b8ea12c20340db9fe8e8e973dbdbd0 [2020-10-05 23:34:58,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:34:58,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:34:58,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:58,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:34:58,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:34:58,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abbea44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58, skipping insertion in model container [2020-10-05 23:34:58,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:34:58,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:34:58,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:58,720 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:34:58,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:58,881 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:34:58,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58 WrapperNode [2020-10-05 23:34:58,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:58,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:58,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:34:58,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:34:58,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:58,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:34:58,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:34:58,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:34:58,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... [2020-10-05 23:34:58,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:34:58,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:34:58,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:34:58,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:34:59,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:34:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:34:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:34:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:34:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:34:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:34:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:34:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:34:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:34:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:34:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:34:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:34:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:34:59,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:34:59,085 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:35:01,360 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:35:01,361 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:35:01,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:01 BoogieIcfgContainer [2020-10-05 23:35:01,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:35:01,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:35:01,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:35:01,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:35:01,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:34:58" (1/3) ... [2020-10-05 23:35:01,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2657eb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:01, skipping insertion in model container [2020-10-05 23:35:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:58" (2/3) ... [2020-10-05 23:35:01,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2657eb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:01, skipping insertion in model container [2020-10-05 23:35:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:01" (3/3) ... [2020-10-05 23:35:01,373 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2020-10-05 23:35:01,385 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:35:01,385 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:35:01,394 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:35:01,395 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:35:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,443 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,451 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,451 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:01,473 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:35:01,496 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:35:01,496 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:35:01,496 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:35:01,497 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:35:01,497 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:35:01,497 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:35:01,497 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:35:01,497 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:35:01,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-05 23:35:01,516 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:35:01,564 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:35:01,564 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:01,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:35:01,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:35:01,595 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:35:01,596 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:01,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:35:01,598 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1642 [2020-10-05 23:35:01,600 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:35:03,796 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-05 23:35:03,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-05 23:35:03,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:03,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:35:03,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:05,042 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-05 23:35:05,565 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:35:05,742 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:35:06,529 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:35:06,901 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:35:07,860 WARN L193 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-10-05 23:35:08,201 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-05 23:35:09,469 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-10-05 23:35:09,788 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-05 23:35:10,184 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:35:10,554 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:35:10,937 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-05 23:35:11,081 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:35:11,088 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4492 [2020-10-05 23:35:11,088 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-05 23:35:11,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:35:11,157 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-05 23:35:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-05 23:35:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:35:11,190 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:11,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:35:11,191 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1003457510, now seen corresponding path program 1 times [2020-10-05 23:35:11,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:11,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212786418] [2020-10-05 23:35:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:11,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212786418] [2020-10-05 23:35:11,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:11,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:11,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228286001] [2020-10-05 23:35:11,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:11,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:11,442 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-05 23:35:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:11,544 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-05 23:35:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:11,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:35:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:11,577 INFO L225 Difference]: With dead ends: 687 [2020-10-05 23:35:11,577 INFO L226 Difference]: Without dead ends: 562 [2020-10-05 23:35:11,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-05 23:35:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-05 23:35:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-05 23:35:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-05 23:35:11,680 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-05 23:35:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:11,680 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-05 23:35:11,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-05 23:35:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:35:11,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:11,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:11,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:35:11,683 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1922104647, now seen corresponding path program 1 times [2020-10-05 23:35:11,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:11,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367161460] [2020-10-05 23:35:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:11,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367161460] [2020-10-05 23:35:11,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:11,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:11,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278758607] [2020-10-05 23:35:11,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:11,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:11,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:11,869 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-05 23:35:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:11,926 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-05 23:35:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:11,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:35:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:11,934 INFO L225 Difference]: With dead ends: 552 [2020-10-05 23:35:11,934 INFO L226 Difference]: Without dead ends: 552 [2020-10-05 23:35:11,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-05 23:35:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-05 23:35:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-05 23:35:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-05 23:35:11,965 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-05 23:35:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:11,966 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-05 23:35:11,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-05 23:35:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:35:11,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:11,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:11,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:35:11,968 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1109692064, now seen corresponding path program 1 times [2020-10-05 23:35:11,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:11,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529381166] [2020-10-05 23:35:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:12,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529381166] [2020-10-05 23:35:12,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:12,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:12,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579099502] [2020-10-05 23:35:12,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:12,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:12,104 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 5 states. [2020-10-05 23:35:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:12,208 INFO L93 Difference]: Finished difference Result 564 states and 1715 transitions. [2020-10-05 23:35:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:12,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-05 23:35:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:12,214 INFO L225 Difference]: With dead ends: 564 [2020-10-05 23:35:12,214 INFO L226 Difference]: Without dead ends: 564 [2020-10-05 23:35:12,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-10-05 23:35:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2020-10-05 23:35:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-10-05 23:35:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1715 transitions. [2020-10-05 23:35:12,237 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1715 transitions. Word has length 10 [2020-10-05 23:35:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:12,237 INFO L479 AbstractCegarLoop]: Abstraction has 564 states and 1715 transitions. [2020-10-05 23:35:12,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1715 transitions. [2020-10-05 23:35:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:12,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:12,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:12,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:35:12,241 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1971258457, now seen corresponding path program 1 times [2020-10-05 23:35:12,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:12,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759623504] [2020-10-05 23:35:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:12,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759623504] [2020-10-05 23:35:12,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:12,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:12,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238279458] [2020-10-05 23:35:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:12,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:12,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:12,334 INFO L87 Difference]: Start difference. First operand 564 states and 1715 transitions. Second operand 5 states. [2020-10-05 23:35:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:12,412 INFO L93 Difference]: Finished difference Result 558 states and 1691 transitions. [2020-10-05 23:35:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:12,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 23:35:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:12,419 INFO L225 Difference]: With dead ends: 558 [2020-10-05 23:35:12,419 INFO L226 Difference]: Without dead ends: 558 [2020-10-05 23:35:12,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-05 23:35:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 549. [2020-10-05 23:35:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:35:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1663 transitions. [2020-10-05 23:35:12,439 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1663 transitions. Word has length 11 [2020-10-05 23:35:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:12,439 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1663 transitions. [2020-10-05 23:35:12,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1663 transitions. [2020-10-05 23:35:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:12,441 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:12,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:12,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:35:12,442 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1275329160, now seen corresponding path program 1 times [2020-10-05 23:35:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:12,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321397079] [2020-10-05 23:35:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:12,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321397079] [2020-10-05 23:35:12,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:12,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:12,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761111443] [2020-10-05 23:35:12,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:12,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:12,559 INFO L87 Difference]: Start difference. First operand 549 states and 1663 transitions. Second operand 6 states. [2020-10-05 23:35:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:12,737 INFO L93 Difference]: Finished difference Result 609 states and 1828 transitions. [2020-10-05 23:35:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:12,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-05 23:35:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:12,743 INFO L225 Difference]: With dead ends: 609 [2020-10-05 23:35:12,744 INFO L226 Difference]: Without dead ends: 609 [2020-10-05 23:35:12,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-10-05 23:35:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 595. [2020-10-05 23:35:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-10-05 23:35:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1795 transitions. [2020-10-05 23:35:12,766 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1795 transitions. Word has length 12 [2020-10-05 23:35:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:12,766 INFO L479 AbstractCegarLoop]: Abstraction has 595 states and 1795 transitions. [2020-10-05 23:35:12,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1795 transitions. [2020-10-05 23:35:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:12,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:12,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:12,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:35:12,768 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1981061887, now seen corresponding path program 1 times [2020-10-05 23:35:12,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:12,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280810579] [2020-10-05 23:35:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:12,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280810579] [2020-10-05 23:35:12,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:12,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:12,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104502563] [2020-10-05 23:35:12,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:12,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:12,946 INFO L87 Difference]: Start difference. First operand 595 states and 1795 transitions. Second operand 4 states. [2020-10-05 23:35:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:12,987 INFO L93 Difference]: Finished difference Result 564 states and 1508 transitions. [2020-10-05 23:35:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:12,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 23:35:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:12,992 INFO L225 Difference]: With dead ends: 564 [2020-10-05 23:35:12,992 INFO L226 Difference]: Without dead ends: 415 [2020-10-05 23:35:12,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-05 23:35:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2020-10-05 23:35:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-10-05 23:35:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1075 transitions. [2020-10-05 23:35:13,008 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1075 transitions. Word has length 12 [2020-10-05 23:35:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:13,009 INFO L479 AbstractCegarLoop]: Abstraction has 415 states and 1075 transitions. [2020-10-05 23:35:13,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1075 transitions. [2020-10-05 23:35:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:13,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:35:13,011 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1720002661, now seen corresponding path program 1 times [2020-10-05 23:35:13,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300405351] [2020-10-05 23:35:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:13,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300405351] [2020-10-05 23:35:13,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:13,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:13,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177907104] [2020-10-05 23:35:13,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:13,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:13,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:13,104 INFO L87 Difference]: Start difference. First operand 415 states and 1075 transitions. Second operand 5 states. [2020-10-05 23:35:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:13,159 INFO L93 Difference]: Finished difference Result 329 states and 788 transitions. [2020-10-05 23:35:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:13,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:35:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:13,162 INFO L225 Difference]: With dead ends: 329 [2020-10-05 23:35:13,162 INFO L226 Difference]: Without dead ends: 255 [2020-10-05 23:35:13,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-05 23:35:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 231. [2020-10-05 23:35:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-05 23:35:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 535 transitions. [2020-10-05 23:35:13,171 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 535 transitions. Word has length 13 [2020-10-05 23:35:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:13,171 INFO L479 AbstractCegarLoop]: Abstraction has 231 states and 535 transitions. [2020-10-05 23:35:13,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 535 transitions. [2020-10-05 23:35:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:35:13,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:35:13,173 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -742899671, now seen corresponding path program 1 times [2020-10-05 23:35:13,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255827911] [2020-10-05 23:35:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:13,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255827911] [2020-10-05 23:35:13,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:13,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:13,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073227972] [2020-10-05 23:35:13,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:13,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:13,367 INFO L87 Difference]: Start difference. First operand 231 states and 535 transitions. Second operand 6 states. [2020-10-05 23:35:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:13,428 INFO L93 Difference]: Finished difference Result 310 states and 691 transitions. [2020-10-05 23:35:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:13,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:35:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:13,431 INFO L225 Difference]: With dead ends: 310 [2020-10-05 23:35:13,431 INFO L226 Difference]: Without dead ends: 288 [2020-10-05 23:35:13,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-05 23:35:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2020-10-05 23:35:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2020-10-05 23:35:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 645 transitions. [2020-10-05 23:35:13,439 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 645 transitions. Word has length 17 [2020-10-05 23:35:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:13,439 INFO L479 AbstractCegarLoop]: Abstraction has 285 states and 645 transitions. [2020-10-05 23:35:13,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 645 transitions. [2020-10-05 23:35:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:35:13,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:35:13,441 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1789459351, now seen corresponding path program 2 times [2020-10-05 23:35:13,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030666926] [2020-10-05 23:35:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:13,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030666926] [2020-10-05 23:35:13,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:13,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:13,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488981650] [2020-10-05 23:35:13,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:13,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:13,542 INFO L87 Difference]: Start difference. First operand 285 states and 645 transitions. Second operand 6 states. [2020-10-05 23:35:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:13,599 INFO L93 Difference]: Finished difference Result 257 states and 588 transitions. [2020-10-05 23:35:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:13,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:35:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:13,601 INFO L225 Difference]: With dead ends: 257 [2020-10-05 23:35:13,602 INFO L226 Difference]: Without dead ends: 230 [2020-10-05 23:35:13,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-05 23:35:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2020-10-05 23:35:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-05 23:35:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 429 transitions. [2020-10-05 23:35:13,608 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 429 transitions. Word has length 17 [2020-10-05 23:35:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:13,608 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 429 transitions. [2020-10-05 23:35:13,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 429 transitions. [2020-10-05 23:35:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:35:13,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:35:13,610 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash 9332787, now seen corresponding path program 1 times [2020-10-05 23:35:13,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131346028] [2020-10-05 23:35:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:13,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131346028] [2020-10-05 23:35:13,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:13,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:13,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136723872] [2020-10-05 23:35:13,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:13,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:13,663 INFO L87 Difference]: Start difference. First operand 182 states and 429 transitions. Second operand 4 states. [2020-10-05 23:35:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:13,682 INFO L93 Difference]: Finished difference Result 240 states and 552 transitions. [2020-10-05 23:35:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:13,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-05 23:35:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:13,684 INFO L225 Difference]: With dead ends: 240 [2020-10-05 23:35:13,684 INFO L226 Difference]: Without dead ends: 94 [2020-10-05 23:35:13,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-05 23:35:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-05 23:35:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 23:35:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 189 transitions. [2020-10-05 23:35:13,687 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 189 transitions. Word has length 21 [2020-10-05 23:35:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:13,688 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 189 transitions. [2020-10-05 23:35:13,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 189 transitions. [2020-10-05 23:35:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:35:13,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:35:13,689 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash 702820371, now seen corresponding path program 2 times [2020-10-05 23:35:13,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319421502] [2020-10-05 23:35:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:13,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319421502] [2020-10-05 23:35:13,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:13,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:35:13,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702414312] [2020-10-05 23:35:13,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:35:13,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:35:13,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:35:13,935 INFO L87 Difference]: Start difference. First operand 94 states and 189 transitions. Second operand 9 states. [2020-10-05 23:35:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,269 INFO L93 Difference]: Finished difference Result 149 states and 289 transitions. [2020-10-05 23:35:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:35:14,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:35:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,271 INFO L225 Difference]: With dead ends: 149 [2020-10-05 23:35:14,272 INFO L226 Difference]: Without dead ends: 117 [2020-10-05 23:35:14,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:35:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-05 23:35:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2020-10-05 23:35:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-05 23:35:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 165 transitions. [2020-10-05 23:35:14,275 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 165 transitions. Word has length 21 [2020-10-05 23:35:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:14,276 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 165 transitions. [2020-10-05 23:35:14,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:35:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 165 transitions. [2020-10-05 23:35:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:35:14,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:14,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:14,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:35:14,277 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash -346290541, now seen corresponding path program 3 times [2020-10-05 23:35:14,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:14,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901017999] [2020-10-05 23:35:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:14,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:14,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:14,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:35:14,384 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:35:14,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:35:14,386 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:35:14,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L2-->L825: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-149294657 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In-149294657 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-149294657 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-149294657 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-149294657 0)) (and .cse2 (= ~x$w_buff0_used~0_Out-149294657 ~x$w_buff0_used~0_In-149294657))) (or (and .cse3 (= ~x$w_buff1_used~0_Out-149294657 0) .cse4) (and (= ~x$w_buff1_used~0_In-149294657 ~x$w_buff1_used~0_Out-149294657) .cse5)) (or (and (= ~x$w_buff0~0_In-149294657 ~x~0_Out-149294657) .cse0 .cse1) (and .cse2 (or (and .cse5 (= ~x~0_In-149294657 ~x~0_Out-149294657)) (and .cse3 .cse4 (= ~x$w_buff1~0_In-149294657 ~x~0_Out-149294657))))) (= ~x$r_buff0_thd0~0_In-149294657 ~x$r_buff0_thd0~0_Out-149294657) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-149294657 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-149294657|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-149294657 0)) (= ~x$r_buff1_thd0~0_Out-149294657 ~x$r_buff1_thd0~0_In-149294657)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-149294657, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-149294657, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-149294657|, ~x$w_buff1~0=~x$w_buff1~0_In-149294657, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-149294657, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-149294657, ~x~0=~x~0_In-149294657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149294657} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-149294657, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-149294657, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-149294657|, ~x$w_buff1~0=~x$w_buff1~0_In-149294657, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-149294657|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-149294657, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-149294657|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-149294657|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-149294657|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-149294657, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-149294657, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-149294657|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-149294657|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-149294657, ~x~0=~x~0_Out-149294657} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:35:14,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,419 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:14,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:14,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:35:14 BasicIcfg [2020-10-05 23:35:14,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:35:14,473 INFO L168 Benchmark]: Toolchain (without parser) took 16325.39 ms. Allocated memory was 139.5 MB in the beginning and 358.6 MB in the end (delta: 219.2 MB). Free memory was 100.5 MB in the beginning and 144.3 MB in the end (delta: -43.8 MB). Peak memory consumption was 175.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,474 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.82 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 156.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,476 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,477 INFO L168 Benchmark]: RCFGBuilder took 2365.15 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 150.5 MB in the beginning and 169.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,478 INFO L168 Benchmark]: TraceAbstraction took 13106.65 ms. Allocated memory was 248.5 MB in the beginning and 358.6 MB in the end (delta: 110.1 MB). Free memory was 169.5 MB in the beginning and 144.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 135.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:14,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.82 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 156.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2365.15 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 150.5 MB in the beginning and 169.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13106.65 ms. Allocated memory was 248.5 MB in the beginning and 358.6 MB in the end (delta: 110.1 MB). Free memory was 169.5 MB in the beginning and 144.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 135.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.5s, 101 ProgramPointsBefore, 36 ProgramPointsAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 835 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4492 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1403; [L810] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 0 pthread_t t1404; [L812] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t1405; [L814] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L787] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L839] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L839] 0 x = x$flush_delayed ? x$mem_tmp : x [L840] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 270 SDtfs, 337 SDslu, 468 SDs, 0 SdLazy, 286 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 133 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 16327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...