/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:39:57,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:39:57,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:39:57,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:39:57,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:39:57,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:39:57,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:39:57,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:39:57,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:39:57,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:39:57,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:39:57,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:39:57,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:39:57,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:39:57,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:39:57,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:39:57,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:39:57,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:39:57,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:39:57,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:39:57,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:39:57,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:39:57,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:39:57,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:39:57,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:39:57,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:39:57,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:39:57,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:39:57,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:39:57,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:39:57,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:39:57,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:39:57,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:39:57,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:39:57,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:39:57,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:39:57,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:39:57,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:39:57,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:39:57,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:39:57,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:39:57,907 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-McrAutomaton-SP.epf [2020-11-09 16:39:57,937 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:39:57,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:39:57,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:39:57,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:39:57,940 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:39:57,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:39:57,940 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:39:57,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:39:57,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:39:57,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:39:57,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:39:57,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:39:57,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:39:57,942 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:39:57,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:39:57,942 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:39:57,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:39:57,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:39:57,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:39:57,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:39:57,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:39:57,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:39:57,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:39:57,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:39:57,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:39:57,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:39:57,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:39:57,945 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:39:57,945 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:39:57,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:39:57,945 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:39:58,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:39:58,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:39:58,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:39:58,365 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:39:58,366 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:39:58,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2020-11-09 16:39:58,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6321eb5e1/5a261b931c424d24814a5a8455853b9c/FLAG6b0744848 [2020-11-09 16:39:59,175 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:39:59,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2020-11-09 16:39:59,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6321eb5e1/5a261b931c424d24814a5a8455853b9c/FLAG6b0744848 [2020-11-09 16:39:59,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6321eb5e1/5a261b931c424d24814a5a8455853b9c [2020-11-09 16:39:59,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:39:59,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:39:59,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:39:59,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:39:59,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:39:59,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:39:59" (1/1) ... [2020-11-09 16:39:59,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c26b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:39:59, skipping insertion in model container [2020-11-09 16:39:59,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:39:59" (1/1) ... [2020-11-09 16:39:59,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:39:59,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:40:00,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:40:00,061 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:40:00,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:40:00,293 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:40:00,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00 WrapperNode [2020-11-09 16:40:00,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:40:00,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:40:00,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:40:00,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:40:00,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:40:00,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:40:00,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:40:00,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:40:00,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (1/1) ... [2020-11-09 16:40:00,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:40:00,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:40:00,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:40:00,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:40:00,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (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-11-09 16:40:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:40:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:40:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:40:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:40:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:40:00,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:40:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:40:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:40:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:40:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:40:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:40:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:40:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:40:00,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:40:00,531 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:40:02,911 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:40:02,911 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:40:02,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:40:02 BoogieIcfgContainer [2020-11-09 16:40:02,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:40:02,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:40:02,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:40:02,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:40:02,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:39:59" (1/3) ... [2020-11-09 16:40:02,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43d1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:40:02, skipping insertion in model container [2020-11-09 16:40:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:40:00" (2/3) ... [2020-11-09 16:40:02,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43d1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:40:02, skipping insertion in model container [2020-11-09 16:40:02,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:40:02" (3/3) ... [2020-11-09 16:40:02,923 INFO L111 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2020-11-09 16:40:02,941 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:40:02,941 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:40:02,945 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:40:02,946 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:40:02,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:02,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,010 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,012 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,013 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,018 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,018 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,027 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:40:03,044 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:40:03,058 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 16:40:03,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:40:03,082 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:40:03,083 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:40:03,083 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:40:03,083 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:40:03,083 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:40:03,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:40:03,083 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:40:03,098 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:40:03,098 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 16:40:03,102 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 16:40:03,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-11-09 16:40:03,158 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-11-09 16:40:03,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:40:03,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-09 16:40:03,172 INFO L116 LiptonReduction]: Number of co-enabled transitions 1844 [2020-11-09 16:40:03,443 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 16:40:03,608 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 16:40:03,734 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 16:40:04,755 WARN L194 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:40:04,905 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:40:05,490 WARN L194 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-09 16:40:05,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:40:05,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:40:06,050 WARN L194 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 16:40:07,103 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:40:07,268 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:40:07,496 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:40:07,759 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:40:09,665 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-09 16:40:09,861 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-09 16:40:10,838 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:40:10,955 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:40:11,073 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:40:11,194 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:40:12,000 WARN L194 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:40:12,268 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:40:12,850 WARN L194 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:40:13,113 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:40:13,119 INFO L131 LiptonReduction]: Checked pairs total: 5473 [2020-11-09 16:40:13,120 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-09 16:40:13,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-11-09 16:40:13,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-11-09 16:40:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-11-09 16:40:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 16:40:13,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:13,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 16:40:13,201 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash 975143875, now seen corresponding path program 1 times [2020-11-09 16:40:13,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:13,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460772594] [2020-11-09 16:40:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:13,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460772594] [2020-11-09 16:40:13,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:13,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:40:13,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207846377] [2020-11-09 16:40:13,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:13,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:13,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 16:40:13,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:13,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:13,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:40:13,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:40:13,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:40:13,618 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-11-09 16:40:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:13,746 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-11-09 16:40:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:40:13,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 16:40:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:13,783 INFO L225 Difference]: With dead ends: 650 [2020-11-09 16:40:13,783 INFO L226 Difference]: Without dead ends: 530 [2020-11-09 16:40:13,784 INFO L677 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-11-09 16:40:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-09 16:40:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-11-09 16:40:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-09 16:40:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-11-09 16:40:13,928 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 5 [2020-11-09 16:40:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:13,929 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-11-09 16:40:13,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:40:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-11-09 16:40:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:40:13,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:13,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:40:13,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:40:13,932 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1480961116, now seen corresponding path program 1 times [2020-11-09 16:40:13,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:13,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129507116] [2020-11-09 16:40:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:14,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129507116] [2020-11-09 16:40:14,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:14,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:40:14,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364171891] [2020-11-09 16:40:14,065 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:14,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:14,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:40:14,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:14,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:14,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:40:14,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:40:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:40:14,071 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-11-09 16:40:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:14,082 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-11-09 16:40:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:40:14,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:40:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:14,088 INFO L225 Difference]: With dead ends: 490 [2020-11-09 16:40:14,088 INFO L226 Difference]: Without dead ends: 490 [2020-11-09 16:40:14,089 INFO L677 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-11-09 16:40:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-11-09 16:40:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-11-09 16:40:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-11-09 16:40:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-11-09 16:40:14,110 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-11-09 16:40:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:14,111 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-11-09 16:40:14,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:40:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-11-09 16:40:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:40:14,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:14,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:40:14,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:40:14,115 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1552062860, now seen corresponding path program 1 times [2020-11-09 16:40:14,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:14,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489443431] [2020-11-09 16:40:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:14,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489443431] [2020-11-09 16:40:14,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:14,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:40:14,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [412878844] [2020-11-09 16:40:14,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:14,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:14,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-11-09 16:40:14,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:14,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:14,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:40:14,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:40:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:40:14,362 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 4 states. [2020-11-09 16:40:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:14,416 INFO L93 Difference]: Finished difference Result 454 states and 1202 transitions. [2020-11-09 16:40:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:40:14,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 16:40:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:14,420 INFO L225 Difference]: With dead ends: 454 [2020-11-09 16:40:14,420 INFO L226 Difference]: Without dead ends: 334 [2020-11-09 16:40:14,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:40:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-11-09 16:40:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2020-11-09 16:40:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-11-09 16:40:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 856 transitions. [2020-11-09 16:40:14,432 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 856 transitions. Word has length 11 [2020-11-09 16:40:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:14,432 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 856 transitions. [2020-11-09 16:40:14,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:40:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 856 transitions. [2020-11-09 16:40:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:40:14,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:14,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:40:14,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:40:14,435 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1884995776, now seen corresponding path program 1 times [2020-11-09 16:40:14,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:14,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585723999] [2020-11-09 16:40:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:14,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585723999] [2020-11-09 16:40:14,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:14,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:40:14,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388225884] [2020-11-09 16:40:14,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:14,633 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:14,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2020-11-09 16:40:14,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:14,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:14,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,701 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:14,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:14,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,867 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:14,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,869 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:14,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:14,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,009 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,012 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,086 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,177 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,188 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,274 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5989#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:40:15,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:40:15,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:40:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:40:15,390 INFO L87 Difference]: Start difference. First operand 334 states and 856 transitions. Second operand 6 states. [2020-11-09 16:40:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:15,445 INFO L93 Difference]: Finished difference Result 267 states and 628 transitions. [2020-11-09 16:40:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:40:15,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 16:40:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:15,447 INFO L225 Difference]: With dead ends: 267 [2020-11-09 16:40:15,447 INFO L226 Difference]: Without dead ends: 207 [2020-11-09 16:40:15,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:40:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-09 16:40:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-11-09 16:40:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-11-09 16:40:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2020-11-09 16:40:15,454 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 475 transitions. Word has length 14 [2020-11-09 16:40:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:15,454 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 475 transitions. [2020-11-09 16:40:15,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:40:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2020-11-09 16:40:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:40:15,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:15,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:40:15,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:40:15,456 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1094508423, now seen corresponding path program 1 times [2020-11-09 16:40:15,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:15,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382444057] [2020-11-09 16:40:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:15,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382444057] [2020-11-09 16:40:15,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:15,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:40:15,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96106785] [2020-11-09 16:40:15,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:15,588 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:15,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2020-11-09 16:40:15,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:15,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:15,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:15,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:15,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,748 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,750 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,751 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,752 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,816 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,817 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,821 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:15,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:15,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:15,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:15,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:16,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,009 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:16,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,011 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:16,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,073 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,074 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,075 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,076 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:16,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:16,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,155 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,156 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,158 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,160 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:16,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:16,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:40:16,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:40:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:40:16,206 INFO L87 Difference]: Start difference. First operand 207 states and 475 transitions. Second operand 4 states. [2020-11-09 16:40:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:16,227 INFO L93 Difference]: Finished difference Result 273 states and 607 transitions. [2020-11-09 16:40:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:40:16,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-09 16:40:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:16,229 INFO L225 Difference]: With dead ends: 273 [2020-11-09 16:40:16,229 INFO L226 Difference]: Without dead ends: 210 [2020-11-09 16:40:16,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-11-09 16:40:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-09 16:40:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2020-11-09 16:40:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-11-09 16:40:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 458 transitions. [2020-11-09 16:40:16,236 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 458 transitions. Word has length 17 [2020-11-09 16:40:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:16,237 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 458 transitions. [2020-11-09 16:40:16,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:40:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 458 transitions. [2020-11-09 16:40:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:40:16,238 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:16,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:40:16,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:40:16,238 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1564664255, now seen corresponding path program 2 times [2020-11-09 16:40:16,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:16,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085293650] [2020-11-09 16:40:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:16,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085293650] [2020-11-09 16:40:16,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:16,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:40:16,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923094539] [2020-11-09 16:40:16,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:16,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:16,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 19 transitions. [2020-11-09 16:40:16,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:16,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:16,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:40:16,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:40:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:40:16,366 INFO L87 Difference]: Start difference. First operand 207 states and 458 transitions. Second operand 6 states. [2020-11-09 16:40:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:16,427 INFO L93 Difference]: Finished difference Result 186 states and 415 transitions. [2020-11-09 16:40:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:40:16,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 16:40:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:16,429 INFO L225 Difference]: With dead ends: 186 [2020-11-09 16:40:16,429 INFO L226 Difference]: Without dead ends: 92 [2020-11-09 16:40:16,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-09 16:40:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-09 16:40:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-09 16:40:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-09 16:40:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-11-09 16:40:16,433 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 17 [2020-11-09 16:40:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:16,433 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-11-09 16:40:16,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:40:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-11-09 16:40:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:40:16,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:16,434 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-11-09 16:40:16,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:40:16,434 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1083504839, now seen corresponding path program 1 times [2020-11-09 16:40:16,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:16,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722028730] [2020-11-09 16:40:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:16,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722028730] [2020-11-09 16:40:16,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:16,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:40:16,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533151088] [2020-11-09 16:40:16,503 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:16,508 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:16,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 56 transitions. [2020-11-09 16:40:16,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:16,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,576 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:16,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:16,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:16,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:16,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:16,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:16,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:16,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:16,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:16,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,776 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:16,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:16,799 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:40:16,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:40:16,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:40:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:40:16,801 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 4 states. [2020-11-09 16:40:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:16,826 INFO L93 Difference]: Finished difference Result 136 states and 272 transitions. [2020-11-09 16:40:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:40:16,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-09 16:40:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:16,827 INFO L225 Difference]: With dead ends: 136 [2020-11-09 16:40:16,827 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 16:40:16,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11-09 16:40:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 16:40:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-09 16:40:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-09 16:40:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 117 transitions. [2020-11-09 16:40:16,831 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 117 transitions. Word has length 21 [2020-11-09 16:40:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:16,831 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 117 transitions. [2020-11-09 16:40:16,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:40:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 117 transitions. [2020-11-09 16:40:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:40:16,832 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:16,832 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-11-09 16:40:16,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:40:16,832 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1291918881, now seen corresponding path program 2 times [2020-11-09 16:40:16,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:16,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890852969] [2020-11-09 16:40:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:40:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:40:17,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890852969] [2020-11-09 16:40:17,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:40:17,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:40:17,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693110884] [2020-11-09 16:40:17,118 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:40:17,126 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:40:17,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2020-11-09 16:40:17,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:40:17,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:40:17,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,228 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:17,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,230 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:40:17,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:40:17,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:40:17,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:40:17,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:17,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,288 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,290 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:17,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,335 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:17,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:17,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,337 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,339 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:17,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:17,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:40:17,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:40:17,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:17,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:17,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:17,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:17,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:17,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:17,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:18,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:18,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:18,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,050 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:18,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:18,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:18,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:18,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,326 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,327 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:18,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:18,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:18,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:18,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:18,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:18,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:18,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 16:40:18,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 16:40:18,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,857 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:40:18,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:40:18,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:40:18,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 16:40:18,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:40:19,059 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8021#(and (or (= 0 ~x$r_buff0_thd1~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$w_buff0_used~0 256) 0)))), 8022#(and (= ~x$w_buff0~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-11-09 16:40:19,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:40:19,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:40:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:40:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:40:19,062 INFO L87 Difference]: Start difference. First operand 64 states and 117 transitions. Second operand 9 states. [2020-11-09 16:40:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:40:19,254 INFO L93 Difference]: Finished difference Result 78 states and 139 transitions. [2020-11-09 16:40:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:40:19,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-09 16:40:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:40:19,256 INFO L225 Difference]: With dead ends: 78 [2020-11-09 16:40:19,256 INFO L226 Difference]: Without dead ends: 42 [2020-11-09 16:40:19,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:40:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-09 16:40:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-09 16:40:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-09 16:40:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2020-11-09 16:40:19,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2020-11-09 16:40:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:40:19,259 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2020-11-09 16:40:19,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:40:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2020-11-09 16:40:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:40:19,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:40:19,260 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-11-09 16:40:19,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:40:19,260 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:40:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:40:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1549815649, now seen corresponding path program 3 times [2020-11-09 16:40:19,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:40:19,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619420744] [2020-11-09 16:40:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:40:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:40:19,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:40:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:40:19,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:40:19,516 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:40:19,517 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:40:19,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:40:19,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:40:19 BasicIcfg [2020-11-09 16:40:19,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:40:19,678 INFO L168 Benchmark]: Toolchain (without parser) took 20248.53 ms. Allocated memory was 151.0 MB in the beginning and 374.3 MB in the end (delta: 223.3 MB). Free memory was 124.4 MB in the beginning and 196.0 MB in the end (delta: -71.6 MB). Peak memory consumption was 152.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,678 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 151.0 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:40:19,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.94 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 120.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 151.0 MB. Free memory was 120.0 MB in the beginning and 117.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,683 INFO L168 Benchmark]: Boogie Preprocessor took 65.40 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 115.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,689 INFO L168 Benchmark]: RCFGBuilder took 2488.90 ms. Allocated memory was 151.0 MB in the beginning and 194.0 MB in the end (delta: 43.0 MB). Free memory was 115.3 MB in the beginning and 121.4 MB in the end (delta: -6.2 MB). Peak memory consumption was 100.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,690 INFO L168 Benchmark]: TraceAbstraction took 16760.13 ms. Allocated memory was 194.0 MB in the beginning and 374.3 MB in the end (delta: 180.4 MB). Free memory was 120.9 MB in the beginning and 196.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 105.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:40:19,693 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91 ms. Allocated memory is still 151.0 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 857.94 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 120.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 151.0 MB. Free memory was 120.0 MB in the beginning and 117.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.40 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 115.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2488.90 ms. Allocated memory was 151.0 MB in the beginning and 194.0 MB in the end (delta: 43.0 MB). Free memory was 115.3 MB in the beginning and 121.4 MB in the end (delta: -6.2 MB). Peak memory consumption was 100.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16760.13 ms. Allocated memory was 194.0 MB in the beginning and 374.3 MB in the end (delta: 180.4 MB). Free memory was 120.9 MB in the beginning and 196.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 105.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 993 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 84 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.0s, 111 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1844 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 5473 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t424; [L837] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L838] 0 pthread_t t425; [L839] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t426; [L841] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 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) [L814] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L814] 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) [L814] 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) [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 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 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L818] 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 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 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) [L791] 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) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 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 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 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 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix016_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=1, 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=1, 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, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 214 SDtfs, 199 SDslu, 374 SDs, 0 SdLazy, 146 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 9097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...