/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/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:50:58,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:50:58,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:50:58,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:50:58,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:50:58,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:50:58,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:50:58,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:50:58,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:50:58,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:50:58,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:50:58,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:50:58,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:50:58,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:50:58,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:50:58,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:50:58,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:50:58,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:50:58,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:50:58,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:50:58,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:50:58,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:50:58,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:50:58,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:50:58,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:50:58,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:50:58,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:50:58,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:50:58,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:50:58,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:50:58,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:50:58,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:50:58,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:50:58,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:50:58,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:50:58,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:50:58,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:50:58,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:50:58,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:50:58,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:50:58,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:50:58,851 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:50:58,906 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:50:58,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:50:58,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:50:58,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:50:58,912 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:50:58,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:50:58,913 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:50:58,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:50:58,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:50:58,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:50:58,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:50:58,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:50:58,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:50:58,915 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:50:58,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:50:58,916 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:50:58,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:50:58,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:50:58,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:50:58,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:50:58,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:50:58,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:50:58,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:50:58,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:50:58,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:50:58,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:50:58,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:50:58,918 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:50:58,918 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:50:58,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:50:58,919 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:50:59,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:50:59,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:50:59,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:50:59,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:50:59,372 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:50:59,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2020-11-09 16:50:59,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60e8c2ca/b0d436d30ece4dbdb3e363cc00ba2eeb/FLAG751bec431 [2020-11-09 16:51:00,148 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:51:00,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2020-11-09 16:51:00,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60e8c2ca/b0d436d30ece4dbdb3e363cc00ba2eeb/FLAG751bec431 [2020-11-09 16:51:00,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60e8c2ca/b0d436d30ece4dbdb3e363cc00ba2eeb [2020-11-09 16:51:00,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:51:00,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:51:00,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:51:00,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:51:00,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:51:00,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:51:00" (1/1) ... [2020-11-09 16:51:00,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3a9ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:00, skipping insertion in model container [2020-11-09 16:51:00,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:51:00" (1/1) ... [2020-11-09 16:51:00,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:51:00,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:51:01,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:51:01,139 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:51:01,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:51:01,359 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:51:01,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01 WrapperNode [2020-11-09 16:51:01,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:51:01,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:51:01,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:51:01,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:51:01,371 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:51:01" (1/1) ... [2020-11-09 16:51:01,437 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:51:01" (1/1) ... [2020-11-09 16:51:01,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:51:01,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:51:01,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:51:01,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:51:01,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (1/1) ... [2020-11-09 16:51:01,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:51:01,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:51:01,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:51:01,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:51:01,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (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:51:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:51:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:51:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:51:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:51:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:51:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:51:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:51:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:51:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:51:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:51:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 16:51:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 16:51:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:51:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:51:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:51:01,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:51:01,640 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:51:03,939 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:51:03,939 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:51:03,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:51:03 BoogieIcfgContainer [2020-11-09 16:51:03,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:51:03,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:51:03,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:51:03,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:51:03,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:51:00" (1/3) ... [2020-11-09 16:51:03,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff01b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:51:03, skipping insertion in model container [2020-11-09 16:51:03,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:51:01" (2/3) ... [2020-11-09 16:51:03,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff01b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:51:03, skipping insertion in model container [2020-11-09 16:51:03,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:51:03" (3/3) ... [2020-11-09 16:51:03,951 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2020-11-09 16:51:03,967 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:51:03,967 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:51:03,971 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:51:03,972 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:51:04,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,011 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,011 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,013 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,016 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,016 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,017 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,017 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,023 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,023 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,025 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,026 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,033 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,034 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,038 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,038 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,040 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,045 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:51:04,048 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:51:04,061 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 16:51:04,085 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:51:04,085 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:51:04,085 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:51:04,085 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:51:04,085 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:51:04,086 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:51:04,086 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:51:04,086 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:51:04,100 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:51:04,101 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-09 16:51:04,104 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-09 16:51:04,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-09 16:51:04,163 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-09 16:51:04,163 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:51:04,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 16:51:04,173 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-09 16:51:04,362 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 16:51:04,477 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 16:51:04,622 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 16:51:05,262 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:51:05,400 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:51:05,953 WARN L194 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-09 16:51:05,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:51:05,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:06,413 WARN L194 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 16:51:08,094 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-09 16:51:08,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-09 16:51:08,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:08,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 16:51:08,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:09,518 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-11-09 16:51:12,097 WARN L194 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2020-11-09 16:51:12,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:51:12,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:51:12,137 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-09 16:51:12,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2020-11-09 16:51:12,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:51:12,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:51:12,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:51:12,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:51:12,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:12,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:51:12,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:51:12,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:51:12,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:51:16,347 WARN L194 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 366 DAG size of output: 277 [2020-11-09 16:51:18,463 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:51:18,585 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:51:18,864 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:51:19,135 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 16:51:19,541 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 16:51:19,735 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 16:51:21,610 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:51:21,755 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:51:21,916 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:51:22,071 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:51:22,713 WARN L194 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-09 16:51:23,009 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-09 16:51:23,634 WARN L194 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-09 16:51:23,922 WARN L194 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-09 16:51:23,930 INFO L131 LiptonReduction]: Checked pairs total: 7618 [2020-11-09 16:51:23,930 INFO L133 LiptonReduction]: Total number of compositions: 101 [2020-11-09 16:51:23,937 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-11-09 16:51:24,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-11-09 16:51:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-11-09 16:51:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:51:24,281 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:24,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:24,282 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 281574382, now seen corresponding path program 1 times [2020-11-09 16:51:24,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:24,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261986173] [2020-11-09 16:51:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:24,741 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:51:24,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261986173] [2020-11-09 16:51:24,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:24,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:51:24,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823498411] [2020-11-09 16:51:24,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:24,751 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:24,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:51:24,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:24,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:24,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:51:24,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:51:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:51:24,803 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-11-09 16:51:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:24,955 INFO L93 Difference]: Finished difference Result 3562 states and 14032 transitions. [2020-11-09 16:51:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:51:24,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:51:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:25,052 INFO L225 Difference]: With dead ends: 3562 [2020-11-09 16:51:25,053 INFO L226 Difference]: Without dead ends: 2602 [2020-11-09 16:51:25,054 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:51:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-09 16:51:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-09 16:51:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-09 16:51:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-09 16:51:25,274 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-09 16:51:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:25,275 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-09 16:51:25,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:51:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-09 16:51:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:51:25,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:25,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:25,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:51:25,281 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 312586641, now seen corresponding path program 1 times [2020-11-09 16:51:25,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:25,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413746795] [2020-11-09 16:51:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:25,436 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:51:25,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413746795] [2020-11-09 16:51:25,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:25,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:51:25,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602070812] [2020-11-09 16:51:25,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:25,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:25,445 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-11-09 16:51:25,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:25,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:25,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:51:25,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:25,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:51:25,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:51:25,449 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-09 16:51:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:25,581 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-11-09 16:51:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:25,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 16:51:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:25,609 INFO L225 Difference]: With dead ends: 2986 [2020-11-09 16:51:25,609 INFO L226 Difference]: Without dead ends: 2506 [2020-11-09 16:51:25,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-09 16:51:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-11-09 16:51:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-11-09 16:51:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-11-09 16:51:25,749 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-11-09 16:51:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:25,749 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-11-09 16:51:25,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:51:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-11-09 16:51:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:51:25,762 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:25,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:25,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:51:25,763 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1112972809, now seen corresponding path program 1 times [2020-11-09 16:51:25,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:25,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958667899] [2020-11-09 16:51:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:26,119 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:51:26,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958667899] [2020-11-09 16:51:26,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:26,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:51:26,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698814758] [2020-11-09 16:51:26,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:26,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:26,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-11-09 16:51:26,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:26,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:26,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:26,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:51:26,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:26,155 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 1] term [2020-11-09 16:51:26,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:26,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:26,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:51:26,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:51:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:26,211 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 5 states. [2020-11-09 16:51:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:26,364 INFO L93 Difference]: Finished difference Result 2890 states and 10768 transitions. [2020-11-09 16:51:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:26,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 16:51:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:26,395 INFO L225 Difference]: With dead ends: 2890 [2020-11-09 16:51:26,395 INFO L226 Difference]: Without dead ends: 2458 [2020-11-09 16:51:26,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:51:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2020-11-09 16:51:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2020-11-09 16:51:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2020-11-09 16:51:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9412 transitions. [2020-11-09 16:51:26,513 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9412 transitions. Word has length 13 [2020-11-09 16:51:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:26,513 INFO L481 AbstractCegarLoop]: Abstraction has 2458 states and 9412 transitions. [2020-11-09 16:51:26,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:51:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9412 transitions. [2020-11-09 16:51:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:51:26,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:26,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:26,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:51:26,521 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1270370849, now seen corresponding path program 1 times [2020-11-09 16:51:26,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:26,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276126152] [2020-11-09 16:51:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:26,690 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:51:26,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276126152] [2020-11-09 16:51:26,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:26,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:51:26,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229102150] [2020-11-09 16:51:26,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:26,697 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:26,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2020-11-09 16:51:26,701 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:26,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:26,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:51:26,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:51:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:51:26,724 INFO L87 Difference]: Start difference. First operand 2458 states and 9412 transitions. Second operand 4 states. [2020-11-09 16:51:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:26,809 INFO L93 Difference]: Finished difference Result 2626 states and 9770 transitions. [2020-11-09 16:51:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:26,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 16:51:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:26,832 INFO L225 Difference]: With dead ends: 2626 [2020-11-09 16:51:26,832 INFO L226 Difference]: Without dead ends: 2218 [2020-11-09 16:51:26,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:51:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-09 16:51:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-09 16:51:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-09 16:51:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-09 16:51:26,967 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-09 16:51:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:26,967 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-09 16:51:26,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:51:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-09 16:51:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:51:26,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:26,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:26,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:51:26,972 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash 385299090, now seen corresponding path program 1 times [2020-11-09 16:51:26,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:26,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922082588] [2020-11-09 16:51:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:27,165 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:51:27,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922082588] [2020-11-09 16:51:27,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:27,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:51:27,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078331958] [2020-11-09 16:51:27,170 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:27,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:27,179 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2020-11-09 16:51:27,179 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:27,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:51:27,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:27,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:51:27,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,274 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:27,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,339 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:51:27,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:27,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:27,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:27,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:51:27,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:51:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:51:27,485 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2020-11-09 16:51:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:27,701 INFO L93 Difference]: Finished difference Result 2410 states and 8888 transitions. [2020-11-09 16:51:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:51:27,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 16:51:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:27,723 INFO L225 Difference]: With dead ends: 2410 [2020-11-09 16:51:27,723 INFO L226 Difference]: Without dead ends: 2122 [2020-11-09 16:51:27,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-09 16:51:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-11-09 16:51:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-09 16:51:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7976 transitions. [2020-11-09 16:51:27,852 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 7976 transitions. Word has length 15 [2020-11-09 16:51:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:27,853 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 7976 transitions. [2020-11-09 16:51:27,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:51:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 7976 transitions. [2020-11-09 16:51:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:51:27,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:27,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:27,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:51:27,859 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -790387480, now seen corresponding path program 1 times [2020-11-09 16:51:27,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:27,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506415792] [2020-11-09 16:51:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:28,030 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:51:28,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506415792] [2020-11-09 16:51:28,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:28,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:28,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557950304] [2020-11-09 16:51:28,031 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:28,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:28,039 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 54 transitions. [2020-11-09 16:51:28,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:28,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:51:28,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:28,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:51:28,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:28,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [46704#(and (= ~z$r_buff0_thd0~0 0) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 46705#(and (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 46703#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0))] [2020-11-09 16:51:28,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 16:51:28,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 16:51:28,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:51:28,317 INFO L87 Difference]: Start difference. First operand 2122 states and 7976 transitions. Second operand 10 states. [2020-11-09 16:51:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:28,652 INFO L93 Difference]: Finished difference Result 2666 states and 9832 transitions. [2020-11-09 16:51:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 16:51:28,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 16:51:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:28,692 INFO L225 Difference]: With dead ends: 2666 [2020-11-09 16:51:28,692 INFO L226 Difference]: Without dead ends: 2442 [2020-11-09 16:51:28,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:51:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-11-09 16:51:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2282. [2020-11-09 16:51:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-09 16:51:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8552 transitions. [2020-11-09 16:51:28,861 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8552 transitions. Word has length 16 [2020-11-09 16:51:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:28,861 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8552 transitions. [2020-11-09 16:51:28,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 16:51:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8552 transitions. [2020-11-09 16:51:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:51:28,868 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:28,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:28,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:51:28,868 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1054931560, now seen corresponding path program 2 times [2020-11-09 16:51:28,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:28,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958943905] [2020-11-09 16:51:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:29,078 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:51:29,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958943905] [2020-11-09 16:51:29,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:29,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:29,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204798839] [2020-11-09 16:51:29,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:29,083 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:29,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2020-11-09 16:51:29,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:29,105 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:29,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:51:29,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:51:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:29,107 INFO L87 Difference]: Start difference. First operand 2282 states and 8552 transitions. Second operand 7 states. [2020-11-09 16:51:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:29,376 INFO L93 Difference]: Finished difference Result 2762 states and 10168 transitions. [2020-11-09 16:51:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:29,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 16:51:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:29,390 INFO L225 Difference]: With dead ends: 2762 [2020-11-09 16:51:29,390 INFO L226 Difference]: Without dead ends: 2506 [2020-11-09 16:51:29,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:51:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-09 16:51:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2442. [2020-11-09 16:51:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-11-09 16:51:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9096 transitions. [2020-11-09 16:51:29,490 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9096 transitions. Word has length 16 [2020-11-09 16:51:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:29,490 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9096 transitions. [2020-11-09 16:51:29,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:51:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9096 transitions. [2020-11-09 16:51:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:51:29,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:29,497 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:51:29,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:51:29,497 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash -727294695, now seen corresponding path program 1 times [2020-11-09 16:51:29,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:29,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615223871] [2020-11-09 16:51:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:29,706 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:51:29,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615223871] [2020-11-09 16:51:29,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:29,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:51:29,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101663316] [2020-11-09 16:51:29,707 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:29,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:29,719 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2020-11-09 16:51:29,719 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:29,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:51:29,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:29,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:29,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:29,987 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 21 [2020-11-09 16:51:29,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:51:29,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:29,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:51:29,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:30,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 2, 1] term [2020-11-09 16:51:30,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:51:30,012 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 16:51:30,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,483 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2020-11-09 16:51:30,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:51:30,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:51:30,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:30,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:30,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:30,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,756 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 18 [2020-11-09 16:51:30,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:51:30,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:51:30,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:30,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:30,973 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 2, 1] term [2020-11-09 16:51:30,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:51:30,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 16:51:30,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:31,414 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [61609#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (or (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff1_used~0 256) 0)) (not (= 2 ~z~0)))), 61610#(and (= ~z$w_buff1~0 0) (or (not (= ~z$w_buff0~0 2)) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$r_buff0_thd0~0 0) (or (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff1_used~0 256) 0)) (not (= 2 ~z~0)))), 61611#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (not (= 2 ~z~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 61612#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (not (= 2 ~z~0))), 61613#(and (= ~z$w_buff1~0 0) (or (not (= ~z$w_buff0~0 2)) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$r_buff0_thd0~0 0)), 61614#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 61615#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0)), 61616#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0))] [2020-11-09 16:51:31,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-09 16:51:31,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-09 16:51:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-11-09 16:51:31,419 INFO L87 Difference]: Start difference. First operand 2442 states and 9096 transitions. Second operand 16 states. [2020-11-09 16:51:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:31,807 INFO L93 Difference]: Finished difference Result 2906 states and 10496 transitions. [2020-11-09 16:51:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:51:31,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-11-09 16:51:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:31,820 INFO L225 Difference]: With dead ends: 2906 [2020-11-09 16:51:31,820 INFO L226 Difference]: Without dead ends: 2426 [2020-11-09 16:51:31,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2020-11-09 16:51:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-11-09 16:51:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1930. [2020-11-09 16:51:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-11-09 16:51:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7080 transitions. [2020-11-09 16:51:31,899 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7080 transitions. Word has length 17 [2020-11-09 16:51:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:31,899 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7080 transitions. [2020-11-09 16:51:31,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-09 16:51:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7080 transitions. [2020-11-09 16:51:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:51:31,904 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:31,905 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:51:31,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:51:31,905 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash 903896851, now seen corresponding path program 1 times [2020-11-09 16:51:31,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:31,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20804679] [2020-11-09 16:51:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:51:32,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20804679] [2020-11-09 16:51:32,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:32,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:51:32,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461160035] [2020-11-09 16:51:32,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:32,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:32,023 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 58 transitions. [2020-11-09 16:51:32,023 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:32,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:32,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:32,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,145 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:32,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:32,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [68395#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 16:51:32,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:51:32,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:51:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:32,370 INFO L87 Difference]: Start difference. First operand 1930 states and 7080 transitions. Second operand 5 states. [2020-11-09 16:51:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:32,477 INFO L93 Difference]: Finished difference Result 1466 states and 4785 transitions. [2020-11-09 16:51:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:32,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 16:51:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:32,482 INFO L225 Difference]: With dead ends: 1466 [2020-11-09 16:51:32,482 INFO L226 Difference]: Without dead ends: 986 [2020-11-09 16:51:32,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-11-09 16:51:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-11-09 16:51:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-11-09 16:51:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2932 transitions. [2020-11-09 16:51:32,514 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2932 transitions. Word has length 17 [2020-11-09 16:51:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:32,514 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 2932 transitions. [2020-11-09 16:51:32,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:51:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2932 transitions. [2020-11-09 16:51:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:51:32,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:32,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:32,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:51:32,517 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash 973657478, now seen corresponding path program 1 times [2020-11-09 16:51:32,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:32,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359528514] [2020-11-09 16:51:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:32,603 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:51:32,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359528514] [2020-11-09 16:51:32,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:32,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:51:32,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [158321124] [2020-11-09 16:51:32,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:32,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:32,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 68 transitions. [2020-11-09 16:51:32,618 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:32,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:32,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:32,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:32,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,706 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:32,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:51:32,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:51:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:51:32,707 INFO L87 Difference]: Start difference. First operand 986 states and 2932 transitions. Second operand 4 states. [2020-11-09 16:51:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:32,767 INFO L93 Difference]: Finished difference Result 1449 states and 4154 transitions. [2020-11-09 16:51:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:32,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-09 16:51:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:32,772 INFO L225 Difference]: With dead ends: 1449 [2020-11-09 16:51:32,772 INFO L226 Difference]: Without dead ends: 1006 [2020-11-09 16:51:32,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:51:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-11-09 16:51:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2020-11-09 16:51:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-11-09 16:51:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2746 transitions. [2020-11-09 16:51:32,802 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2746 transitions. Word has length 20 [2020-11-09 16:51:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:32,803 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 2746 transitions. [2020-11-09 16:51:32,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:51:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2746 transitions. [2020-11-09 16:51:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:51:32,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:32,806 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:51:32,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:51:32,807 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -936682863, now seen corresponding path program 1 times [2020-11-09 16:51:32,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:32,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028127701] [2020-11-09 16:51:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:32,946 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:51:32,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028127701] [2020-11-09 16:51:32,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:32,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:32,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560262409] [2020-11-09 16:51:32,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:32,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:32,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 149 transitions. [2020-11-09 16:51:32,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:32,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:32,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:32,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:32,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:32,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,066 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:33,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:33,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,322 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,324 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [75248#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0))] [2020-11-09 16:51:33,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:51:33,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:51:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:33,500 INFO L87 Difference]: Start difference. First operand 974 states and 2746 transitions. Second operand 8 states. [2020-11-09 16:51:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:33,604 INFO L93 Difference]: Finished difference Result 1305 states and 3591 transitions. [2020-11-09 16:51:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:51:33,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-09 16:51:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:33,606 INFO L225 Difference]: With dead ends: 1305 [2020-11-09 16:51:33,607 INFO L226 Difference]: Without dead ends: 584 [2020-11-09 16:51:33,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:51:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-11-09 16:51:33,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-11-09 16:51:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-11-09 16:51:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1489 transitions. [2020-11-09 16:51:33,624 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1489 transitions. Word has length 21 [2020-11-09 16:51:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:33,625 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1489 transitions. [2020-11-09 16:51:33,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:51:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1489 transitions. [2020-11-09 16:51:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:51:33,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:33,627 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:51:33,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:51:33,627 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1893798298, now seen corresponding path program 1 times [2020-11-09 16:51:33,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:33,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501337184] [2020-11-09 16:51:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:33,703 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:51:33,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501337184] [2020-11-09 16:51:33,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:33,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:33,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854034603] [2020-11-09 16:51:33,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:33,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:33,746 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 140 transitions. [2020-11-09 16:51:33,746 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:33,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:33,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:33,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:33,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,926 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:33,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:33,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:33,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,137 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:34,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:51:34,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:34,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:51:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:51:34,138 INFO L87 Difference]: Start difference. First operand 584 states and 1489 transitions. Second operand 6 states. [2020-11-09 16:51:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:34,220 INFO L93 Difference]: Finished difference Result 469 states and 1133 transitions. [2020-11-09 16:51:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:34,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-09 16:51:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:34,222 INFO L225 Difference]: With dead ends: 469 [2020-11-09 16:51:34,223 INFO L226 Difference]: Without dead ends: 384 [2020-11-09 16:51:34,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2020-11-09 16:51:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2020-11-09 16:51:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-09 16:51:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 921 transitions. [2020-11-09 16:51:34,235 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 921 transitions. Word has length 21 [2020-11-09 16:51:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:34,235 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 921 transitions. [2020-11-09 16:51:34,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:51:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 921 transitions. [2020-11-09 16:51:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 16:51:34,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:34,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:34,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:51:34,237 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -372813351, now seen corresponding path program 1 times [2020-11-09 16:51:34,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:34,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460707783] [2020-11-09 16:51:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:34,344 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:51:34,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460707783] [2020-11-09 16:51:34,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:34,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:51:34,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496465960] [2020-11-09 16:51:34,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:34,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:34,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 155 transitions. [2020-11-09 16:51:34,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:34,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:34,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:34,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:34,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:34,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,511 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,593 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,594 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,595 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:34,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:51:34,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:51:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:34,693 INFO L87 Difference]: Start difference. First operand 384 states and 921 transitions. Second operand 7 states. [2020-11-09 16:51:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:34,787 INFO L93 Difference]: Finished difference Result 353 states and 859 transitions. [2020-11-09 16:51:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:51:34,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-09 16:51:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:34,789 INFO L225 Difference]: With dead ends: 353 [2020-11-09 16:51:34,789 INFO L226 Difference]: Without dead ends: 172 [2020-11-09 16:51:34,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-09 16:51:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-11-09 16:51:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-09 16:51:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 393 transitions. [2020-11-09 16:51:34,795 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 393 transitions. Word has length 24 [2020-11-09 16:51:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:34,795 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 393 transitions. [2020-11-09 16:51:34,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:51:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 393 transitions. [2020-11-09 16:51:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:51:34,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:34,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:34,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:51:34,797 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:34,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 31444714, now seen corresponding path program 1 times [2020-11-09 16:51:34,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:34,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75605536] [2020-11-09 16:51:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:34,880 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:51:34,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75605536] [2020-11-09 16:51:34,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:34,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:51:34,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328994123] [2020-11-09 16:51:34,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:34,888 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:34,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 195 transitions. [2020-11-09 16:51:34,951 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:34,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:34,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:34,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:34,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,032 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,127 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,322 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,324 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,484 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:35,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:35,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,486 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:35,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:35,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:35,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:51:35,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:51:35,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:35,520 INFO L87 Difference]: Start difference. First operand 172 states and 393 transitions. Second operand 5 states. [2020-11-09 16:51:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:35,567 INFO L93 Difference]: Finished difference Result 221 states and 499 transitions. [2020-11-09 16:51:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:35,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-09 16:51:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:35,568 INFO L225 Difference]: With dead ends: 221 [2020-11-09 16:51:35,568 INFO L226 Difference]: Without dead ends: 65 [2020-11-09 16:51:35,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-09 16:51:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-09 16:51:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-09 16:51:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-09 16:51:35,571 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-11-09 16:51:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:35,572 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-09 16:51:35,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:51:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-09 16:51:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:51:35,572 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:35,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:35,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:51:35,573 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2001350532, now seen corresponding path program 2 times [2020-11-09 16:51:35,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:35,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304736054] [2020-11-09 16:51:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:51:35,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:51:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:51:35,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:51:35,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:51:35,713 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:51:35,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 16:51:35,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:51:35 BasicIcfg [2020-11-09 16:51:35,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:51:35,839 INFO L168 Benchmark]: Toolchain (without parser) took 35435.25 ms. Allocated memory was 151.0 MB in the beginning and 367.0 MB in the end (delta: 216.0 MB). Free memory was 125.2 MB in the beginning and 140.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 201.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:35,840 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 151.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:51:35,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 948.38 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 90.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:35,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.50 ms. Allocated memory is still 151.0 MB. Free memory was 89.8 MB in the beginning and 132.2 MB in the end (delta: -42.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:35,842 INFO L168 Benchmark]: Boogie Preprocessor took 52.21 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 130.1 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:51:35,843 INFO L168 Benchmark]: RCFGBuilder took 2396.09 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 130.1 MB in the beginning and 130.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 101.2 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:35,843 INFO L168 Benchmark]: TraceAbstraction took 31894.54 ms. Allocated memory was 181.4 MB in the beginning and 367.0 MB in the end (delta: 185.6 MB). Free memory was 129.6 MB in the beginning and 140.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 174.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:35,848 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.68 ms. Allocated memory is still 151.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 948.38 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 90.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 130.50 ms. Allocated memory is still 151.0 MB. Free memory was 89.8 MB in the beginning and 132.2 MB in the end (delta: -42.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.21 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 130.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2396.09 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 130.1 MB in the beginning and 130.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 101.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31894.54 ms. Allocated memory was 181.4 MB in the beginning and 367.0 MB in the end (delta: 185.6 MB). Free memory was 129.6 MB in the beginning and 140.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 174.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1487 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 169 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 19.8s, 131 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 35 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 7618 MoverChecksTotal - CounterExampleResult [Line: 17]: 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1229; [L847] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1230; [L849] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1231; [L851] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1232; [L853] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.1s, HoareTripleCheckerStatistics: 581 SDtfs, 775 SDslu, 1397 SDs, 0 SdLazy, 436 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 263 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred 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: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 752 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 24363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...