/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:46:21,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:46:21,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:46:21,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:46:21,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:46:21,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:46:21,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:46:21,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:46:21,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:46:21,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:46:21,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:46:21,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:46:21,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:46:21,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:46:21,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:46:21,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:46:21,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:46:21,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:46:21,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:46:21,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:46:21,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:46:21,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:46:21,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:46:21,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:46:21,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:46:21,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:46:21,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:46:21,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:46:21,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:46:21,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:46:21,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:46:21,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:46:21,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:46:21,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:46:21,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:46:21,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:46:21,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:46:21,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:46:21,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:46:21,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:46:21,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:46:21,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:46:21,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:46:21,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:46:21,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:46:21,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:46:21,853 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:46:21,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:46:21,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:46:21,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:46:21,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:46:21,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:46:21,855 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:46:21,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:46:21,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:46:21,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:46:21,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:46:21,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:46:21,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:21,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:46:21,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:46:21,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:46:21,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:46:21,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:46:21,857 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:46:21,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:46:21,858 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:46:21,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:46:22,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:46:22,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:46:22,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:46:22,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:46:22,184 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:46:22,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 18:46:22,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c114937/febe8d6f8c404ecbb8efd06c455bda35/FLAGe3c89b185 [2019-12-27 18:46:22,845 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:46:22,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 18:46:22,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c114937/febe8d6f8c404ecbb8efd06c455bda35/FLAGe3c89b185 [2019-12-27 18:46:23,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c114937/febe8d6f8c404ecbb8efd06c455bda35 [2019-12-27 18:46:23,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:46:23,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:46:23,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:23,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:46:23,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:46:23,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b357da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23, skipping insertion in model container [2019-12-27 18:46:23,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:46:23,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:46:23,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:23,717 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:46:23,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:23,874 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:46:23,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23 WrapperNode [2019-12-27 18:46:23,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:23,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:23,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:46:23,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:46:23,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:23,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:46:23,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:46:23,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:46:23,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (1/1) ... [2019-12-27 18:46:23,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:46:23,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:46:23,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:46:23,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:46:23,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (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 [2019-12-27 18:46:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:46:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:46:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:46:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:46:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:46:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:46:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:46:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:46:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:46:24,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:46:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:46:24,069 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:46:24,771 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:46:24,771 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:46:24,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:24 BoogieIcfgContainer [2019-12-27 18:46:24,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:46:24,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:46:24,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:46:24,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:46:24,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:46:23" (1/3) ... [2019-12-27 18:46:24,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e4392c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:24, skipping insertion in model container [2019-12-27 18:46:24,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:23" (2/3) ... [2019-12-27 18:46:24,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e4392c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:24, skipping insertion in model container [2019-12-27 18:46:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:24" (3/3) ... [2019-12-27 18:46:24,783 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-27 18:46:24,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:46:24,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:46:24,803 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:46:24,804 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:46:24,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,879 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:24,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:46:24,925 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:46:24,925 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:46:24,925 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:46:24,926 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:46:24,926 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:46:24,926 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:46:24,926 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:46:24,926 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:46:24,950 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 18:46:24,953 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:25,096 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:25,097 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:25,109 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:25,125 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:25,173 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:25,173 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:25,181 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:25,200 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:46:25,201 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:29,604 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 18:46:29,726 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 18:46:29,727 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 18:46:29,729 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 18:46:30,167 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 18:46:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 18:46:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:46:30,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:30,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:46:30,183 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:30,189 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 18:46:30,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:30,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936533420] [2019-12-27 18:46:30,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:30,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936533420] [2019-12-27 18:46:30,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:30,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:46:30,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [537765426] [2019-12-27 18:46:30,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:30,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:30,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:46:30,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:30,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:30,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:30,504 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 18:46:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:30,799 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 18:46:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:30,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:46:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:30,914 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:46:30,915 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 18:46:30,916 INFO L631 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 [2019-12-27 18:46:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 18:46:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 18:46:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 18:46:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 18:46:31,375 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 18:46:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:31,376 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 18:46:31,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 18:46:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:31,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:31,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:31,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 18:46:31,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:31,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342663966] [2019-12-27 18:46:31,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:31,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342663966] [2019-12-27 18:46:31,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:31,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:31,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1659354056] [2019-12-27 18:46:31,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:31,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:31,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:31,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:31,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:31,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:31,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:31,562 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 18:46:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:32,156 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 18:46:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:32,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:32,235 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 18:46:32,235 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 18:46:32,236 INFO L631 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 [2019-12-27 18:46:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 18:46:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 18:46:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 18:46:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 18:46:32,688 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 18:46:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:32,689 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 18:46:32,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 18:46:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:32,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:32,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:32,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 18:46:32,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:32,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50552244] [2019-12-27 18:46:32,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:32,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50552244] [2019-12-27 18:46:32,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:32,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:32,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408104319] [2019-12-27 18:46:32,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:32,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:32,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:32,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:32,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:32,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:32,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:32,767 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 18:46:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:33,702 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-27 18:46:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:33,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:33,758 INFO L225 Difference]: With dead ends: 14268 [2019-12-27 18:46:33,758 INFO L226 Difference]: Without dead ends: 14268 [2019-12-27 18:46:33,759 INFO L631 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 [2019-12-27 18:46:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-27 18:46:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-27 18:46:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-27 18:46:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-27 18:46:34,257 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-27 18:46:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:34,260 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-27 18:46:34,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-27 18:46:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:46:34,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:34,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:34,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-27 18:46:34,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:34,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622764573] [2019-12-27 18:46:34,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:34,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622764573] [2019-12-27 18:46:34,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:34,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:34,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78940945] [2019-12-27 18:46:34,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:34,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:34,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 45 transitions. [2019-12-27 18:46:34,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:34,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:34,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:34,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:34,389 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-27 18:46:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:35,006 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-27 18:46:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:46:35,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:46:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:35,063 INFO L225 Difference]: With dead ends: 17010 [2019-12-27 18:46:35,063 INFO L226 Difference]: Without dead ends: 17003 [2019-12-27 18:46:35,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-27 18:46:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-27 18:46:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-27 18:46:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-27 18:46:35,507 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-27 18:46:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:35,507 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-27 18:46:35,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-27 18:46:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:46:35,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:35,521 INFO L411 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] [2019-12-27 18:46:35,521 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-27 18:46:35,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:35,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417394591] [2019-12-27 18:46:35,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:35,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417394591] [2019-12-27 18:46:35,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:35,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:35,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195781751] [2019-12-27 18:46:35,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:35,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:35,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:46:35,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:35,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:35,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:35,576 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-27 18:46:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:35,696 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-27 18:46:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:35,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 18:46:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:35,746 INFO L225 Difference]: With dead ends: 15529 [2019-12-27 18:46:35,746 INFO L226 Difference]: Without dead ends: 15529 [2019-12-27 18:46:35,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-27 18:46:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-27 18:46:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-27 18:46:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-27 18:46:36,276 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-27 18:46:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:36,277 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-27 18:46:36,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-27 18:46:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:46:36,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:36,291 INFO L411 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] [2019-12-27 18:46:36,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-27 18:46:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711947349] [2019-12-27 18:46:36,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711947349] [2019-12-27 18:46:36,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:36,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:36,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950551525] [2019-12-27 18:46:36,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:36,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:36,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:46:36,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:36,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:36,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:36,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:36,377 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-27 18:46:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:36,896 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-27 18:46:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:46:36,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:46:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:36,961 INFO L225 Difference]: With dead ends: 19657 [2019-12-27 18:46:36,962 INFO L226 Difference]: Without dead ends: 19641 [2019-12-27 18:46:36,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-27 18:46:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-27 18:46:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-27 18:46:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-27 18:46:37,528 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-27 18:46:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:37,529 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-27 18:46:37,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-27 18:46:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:46:37,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:37,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:37,559 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:37,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-27 18:46:37,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:37,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453127144] [2019-12-27 18:46:37,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:37,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453127144] [2019-12-27 18:46:37,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:37,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513604219] [2019-12-27 18:46:37,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:37,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:37,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 68 transitions. [2019-12-27 18:46:37,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:37,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:46:37,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:37,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:37,761 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 6 states. [2019-12-27 18:46:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:38,103 INFO L93 Difference]: Finished difference Result 2448 states and 5588 transitions. [2019-12-27 18:46:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:46:38,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:46:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:38,110 INFO L225 Difference]: With dead ends: 2448 [2019-12-27 18:46:38,110 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 18:46:38,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 18:46:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1970. [2019-12-27 18:46:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-27 18:46:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-27 18:46:38,146 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-27 18:46:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:38,147 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-27 18:46:38,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-27 18:46:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:46:38,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:38,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:38,152 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-27 18:46:38,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:38,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640219378] [2019-12-27 18:46:38,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:38,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640219378] [2019-12-27 18:46:38,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:38,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:38,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489876541] [2019-12-27 18:46:38,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:38,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:38,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:46:38,337 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:38,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:38,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:38,340 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 5 states. [2019-12-27 18:46:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:38,398 INFO L93 Difference]: Finished difference Result 415 states and 757 transitions. [2019-12-27 18:46:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:38,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:46:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:38,400 INFO L225 Difference]: With dead ends: 415 [2019-12-27 18:46:38,400 INFO L226 Difference]: Without dead ends: 370 [2019-12-27 18:46:38,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-27 18:46:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 342. [2019-12-27 18:46:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 18:46:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 617 transitions. [2019-12-27 18:46:38,410 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 617 transitions. Word has length 37 [2019-12-27 18:46:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:38,413 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 617 transitions. [2019-12-27 18:46:38,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 617 transitions. [2019-12-27 18:46:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:38,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:38,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:38,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1093435048, now seen corresponding path program 1 times [2019-12-27 18:46:38,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:38,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854810557] [2019-12-27 18:46:38,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:38,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854810557] [2019-12-27 18:46:38,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:46:38,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629272819] [2019-12-27 18:46:38,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:38,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:38,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 111 transitions. [2019-12-27 18:46:38,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:38,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:46:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:46:38,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:46:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:46:38,731 INFO L87 Difference]: Start difference. First operand 342 states and 617 transitions. Second operand 10 states. [2019-12-27 18:46:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:39,970 INFO L93 Difference]: Finished difference Result 910 states and 1590 transitions. [2019-12-27 18:46:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:46:39,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 18:46:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:39,973 INFO L225 Difference]: With dead ends: 910 [2019-12-27 18:46:39,973 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 18:46:39,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:46:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 18:46:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 415. [2019-12-27 18:46:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-27 18:46:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 749 transitions. [2019-12-27 18:46:39,982 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 749 transitions. Word has length 52 [2019-12-27 18:46:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 749 transitions. [2019-12-27 18:46:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:46:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 749 transitions. [2019-12-27 18:46:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:39,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:39,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:39,984 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash -690731774, now seen corresponding path program 2 times [2019-12-27 18:46:39,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:39,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211019653] [2019-12-27 18:46:39,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:40,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211019653] [2019-12-27 18:46:40,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:40,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:40,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199121764] [2019-12-27 18:46:40,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:40,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:40,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 126 transitions. [2019-12-27 18:46:40,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:40,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:40,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:40,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:40,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:40,129 INFO L87 Difference]: Start difference. First operand 415 states and 749 transitions. Second operand 5 states. [2019-12-27 18:46:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:40,330 INFO L93 Difference]: Finished difference Result 592 states and 1074 transitions. [2019-12-27 18:46:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:40,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:46:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:40,332 INFO L225 Difference]: With dead ends: 592 [2019-12-27 18:46:40,332 INFO L226 Difference]: Without dead ends: 592 [2019-12-27 18:46:40,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-27 18:46:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 496. [2019-12-27 18:46:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-12-27 18:46:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 907 transitions. [2019-12-27 18:46:40,340 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 907 transitions. Word has length 52 [2019-12-27 18:46:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:40,340 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 907 transitions. [2019-12-27 18:46:40,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 907 transitions. [2019-12-27 18:46:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:40,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:40,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:40,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1583281740, now seen corresponding path program 3 times [2019-12-27 18:46:40,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:40,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790187687] [2019-12-27 18:46:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:40,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790187687] [2019-12-27 18:46:40,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:40,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:46:40,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393800461] [2019-12-27 18:46:40,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:40,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:40,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 18:46:40,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:40,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:40,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:40,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:40,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:40,509 INFO L87 Difference]: Start difference. First operand 496 states and 907 transitions. Second operand 6 states. [2019-12-27 18:46:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:40,817 INFO L93 Difference]: Finished difference Result 697 states and 1262 transitions. [2019-12-27 18:46:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:46:40,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 18:46:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:40,819 INFO L225 Difference]: With dead ends: 697 [2019-12-27 18:46:40,819 INFO L226 Difference]: Without dead ends: 697 [2019-12-27 18:46:40,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:46:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-12-27 18:46:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 529. [2019-12-27 18:46:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 18:46:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 968 transitions. [2019-12-27 18:46:40,831 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 968 transitions. Word has length 52 [2019-12-27 18:46:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:40,831 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 968 transitions. [2019-12-27 18:46:40,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 968 transitions. [2019-12-27 18:46:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:40,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:40,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:40,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1092311168, now seen corresponding path program 4 times [2019-12-27 18:46:40,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:40,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023540525] [2019-12-27 18:46:40,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:40,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023540525] [2019-12-27 18:46:40,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:40,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:40,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [939385324] [2019-12-27 18:46:40,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:40,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:40,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 113 transitions. [2019-12-27 18:46:40,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:40,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:46:40,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:40,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:41,000 INFO L87 Difference]: Start difference. First operand 529 states and 968 transitions. Second operand 5 states. [2019-12-27 18:46:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:41,125 INFO L93 Difference]: Finished difference Result 607 states and 1064 transitions. [2019-12-27 18:46:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:41,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:46:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:41,127 INFO L225 Difference]: With dead ends: 607 [2019-12-27 18:46:41,128 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 18:46:41,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 18:46:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 476. [2019-12-27 18:46:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 18:46:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 848 transitions. [2019-12-27 18:46:41,139 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 848 transitions. Word has length 52 [2019-12-27 18:46:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:41,139 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 848 transitions. [2019-12-27 18:46:41,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 848 transitions. [2019-12-27 18:46:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:41,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:41,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:41,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 1 times [2019-12-27 18:46:41,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:41,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199489240] [2019-12-27 18:46:41,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:41,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199489240] [2019-12-27 18:46:41,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:41,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:41,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868687426] [2019-12-27 18:46:41,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:41,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:41,307 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 80 transitions. [2019-12-27 18:46:41,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:41,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:41,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:41,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:41,309 INFO L87 Difference]: Start difference. First operand 476 states and 848 transitions. Second operand 3 states. [2019-12-27 18:46:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:41,351 INFO L93 Difference]: Finished difference Result 475 states and 846 transitions. [2019-12-27 18:46:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:41,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:46:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:41,352 INFO L225 Difference]: With dead ends: 475 [2019-12-27 18:46:41,352 INFO L226 Difference]: Without dead ends: 475 [2019-12-27 18:46:41,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-27 18:46:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 329. [2019-12-27 18:46:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 18:46:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2019-12-27 18:46:41,359 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 53 [2019-12-27 18:46:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:41,360 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2019-12-27 18:46:41,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-27 18:46:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:41,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:41,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:41,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1896622654, now seen corresponding path program 1 times [2019-12-27 18:46:41,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:41,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979959906] [2019-12-27 18:46:41,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:41,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979959906] [2019-12-27 18:46:41,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:41,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:41,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973322827] [2019-12-27 18:46:41,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:41,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:41,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 18:46:41,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:41,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:41,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:41,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:41,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:41,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:41,558 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand 5 states. [2019-12-27 18:46:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:41,617 INFO L93 Difference]: Finished difference Result 506 states and 889 transitions. [2019-12-27 18:46:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:41,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 18:46:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:41,618 INFO L225 Difference]: With dead ends: 506 [2019-12-27 18:46:41,618 INFO L226 Difference]: Without dead ends: 219 [2019-12-27 18:46:41,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-12-27 18:46:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-12-27 18:46:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 18:46:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 18:46:41,626 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 54 [2019-12-27 18:46:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:41,627 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 18:46:41,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 18:46:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:41,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:41,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:41,629 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 2 times [2019-12-27 18:46:41,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:41,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366100834] [2019-12-27 18:46:41,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:41,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366100834] [2019-12-27 18:46:41,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:41,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:46:41,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2089057678] [2019-12-27 18:46:41,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:41,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:41,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 113 transitions. [2019-12-27 18:46:41,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:42,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:46:42,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:46:42,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:46:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:46:42,140 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 15 states. [2019-12-27 18:46:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:44,151 INFO L93 Difference]: Finished difference Result 562 states and 956 transitions. [2019-12-27 18:46:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:46:44,152 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 18:46:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:44,153 INFO L225 Difference]: With dead ends: 562 [2019-12-27 18:46:44,153 INFO L226 Difference]: Without dead ends: 531 [2019-12-27 18:46:44,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:46:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-27 18:46:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 319. [2019-12-27 18:46:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 18:46:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 18:46:44,161 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 18:46:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:44,161 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 18:46:44,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:46:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 18:46:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:44,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:44,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:44,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 3 times [2019-12-27 18:46:44,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:44,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778975827] [2019-12-27 18:46:44,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:44,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778975827] [2019-12-27 18:46:44,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:44,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 18:46:44,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822823764] [2019-12-27 18:46:44,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:44,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:44,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 102 transitions. [2019-12-27 18:46:44,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:46:44,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:46:44,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:46:44,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:46:44,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:46:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:46:44,977 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 23 states. [2019-12-27 18:46:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:46,443 INFO L93 Difference]: Finished difference Result 797 states and 1372 transitions. [2019-12-27 18:46:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:46:46,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-27 18:46:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:46,445 INFO L225 Difference]: With dead ends: 797 [2019-12-27 18:46:46,445 INFO L226 Difference]: Without dead ends: 766 [2019-12-27 18:46:46,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:46:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-27 18:46:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 347. [2019-12-27 18:46:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-27 18:46:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 614 transitions. [2019-12-27 18:46:46,453 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 614 transitions. Word has length 54 [2019-12-27 18:46:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:46,454 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 614 transitions. [2019-12-27 18:46:46,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:46:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 614 transitions. [2019-12-27 18:46:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:46,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:46,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:46,455 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1701611196, now seen corresponding path program 4 times [2019-12-27 18:46:46,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:46,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420212440] [2019-12-27 18:46:46,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:46,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420212440] [2019-12-27 18:46:46,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:46,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:46:46,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842862456] [2019-12-27 18:46:46,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:46,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:46,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 126 transitions. [2019-12-27 18:46:46,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:46,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:46:46,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:46:46,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:46:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:46:46,819 INFO L87 Difference]: Start difference. First operand 347 states and 614 transitions. Second operand 14 states. [2019-12-27 18:46:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:47,233 INFO L93 Difference]: Finished difference Result 448 states and 766 transitions. [2019-12-27 18:46:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:46:47,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 18:46:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:47,234 INFO L225 Difference]: With dead ends: 448 [2019-12-27 18:46:47,235 INFO L226 Difference]: Without dead ends: 417 [2019-12-27 18:46:47,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:46:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-27 18:46:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 327. [2019-12-27 18:46:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 18:46:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-27 18:46:47,242 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-27 18:46:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:47,242 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-27 18:46:47,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:46:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-27 18:46:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:47,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:47,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:47,244 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 5 times [2019-12-27 18:46:47,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:47,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150373512] [2019-12-27 18:46:47,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:47,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:46:47,337 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:46:47,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| 4)) (= 0 |v_ULTIMATE.start_main_~#t2481~0.offset_16|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19|) 0) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2481~0.base_19|) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19| 1)) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19|) |v_ULTIMATE.start_main_~#t2481~0.offset_16| 0)) |v_#memory_int_15|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2481~0.offset=|v_ULTIMATE.start_main_~#t2481~0.offset_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_19|, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ULTIMATE.start_main_~#t2481~0.base=|v_ULTIMATE.start_main_~#t2481~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2481~0.offset, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2482~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2482~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ULTIMATE.start_main_~#t2481~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:46:47,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2482~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11|) |v_ULTIMATE.start_main_~#t2482~0.offset_10| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2482~0.base_11|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2482~0.offset_10|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| 4) |v_#length_9|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_10|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2482~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2482~0.base, #length] because there is no mapped edge [2019-12-27 18:46:47,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:46:47,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In349894961 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In349894961 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out349894961| ~y$w_buff0_used~0_In349894961)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out349894961| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In349894961, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In349894961} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out349894961|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In349894961, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In349894961} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:46:47,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2147398848 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2147398848 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out2147398848| ~y$w_buff1~0_In2147398848) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2147398848| ~y~0_In2147398848)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2147398848, ~y$w_buff1~0=~y$w_buff1~0_In2147398848, ~y~0=~y~0_In2147398848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147398848} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2147398848, ~y$w_buff1~0=~y$w_buff1~0_In2147398848, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2147398848|, ~y~0=~y~0_In2147398848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147398848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:46:47,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:46:47,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1351785353 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1351785353 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1351785353|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1351785353 |P1Thread1of1ForFork1_#t~ite11_Out1351785353|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1351785353, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1351785353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1351785353, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1351785353, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1351785353|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:46:47,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-346221749 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-346221749 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-346221749 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-346221749 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-346221749|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-346221749 |P0Thread1of1ForFork0_#t~ite6_Out-346221749|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-346221749, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-346221749, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-346221749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-346221749} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-346221749|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-346221749, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-346221749, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-346221749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-346221749} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:46:47,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1789643144 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1789643144 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1789643144)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-1789643144 ~y$r_buff0_thd1~0_Out-1789643144)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789643144, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1789643144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789643144, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1789643144|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1789643144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:46:47,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1806242857 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1806242857 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1806242857 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1806242857 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1806242857 |P1Thread1of1ForFork1_#t~ite12_Out1806242857|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1806242857|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1806242857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1806242857, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1806242857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806242857} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1806242857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1806242857, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1806242857, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1806242857|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806242857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:46:47,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-409800214 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-409800214 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-409800214 |P1Thread1of1ForFork1_#t~ite13_Out-409800214|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-409800214|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-409800214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409800214} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-409800214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409800214, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-409800214|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:46:47,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-38390759 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-38390759 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-38390759 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-38390759 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-38390759| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-38390759| ~y$r_buff1_thd2~0_In-38390759) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-38390759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-38390759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-38390759, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-38390759} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-38390759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-38390759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-38390759, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-38390759|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-38390759} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:46:47,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:46:47,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1331019139 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1331019139 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1331019139 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1331019139 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1331019139| ~y$r_buff1_thd1~0_In-1331019139) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1331019139| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1331019139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1331019139, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1331019139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1331019139} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1331019139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1331019139, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1331019139|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1331019139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1331019139} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:46:47,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:46:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:46:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-2032884261 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2032884261 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-2032884261| ~y$w_buff1~0_In-2032884261) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-2032884261| ~y~0_In-2032884261) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2032884261, ~y~0=~y~0_In-2032884261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032884261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032884261} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2032884261|, ~y$w_buff1~0=~y$w_buff1~0_In-2032884261, ~y~0=~y~0_In-2032884261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032884261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032884261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 18:46:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 18:46:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In492805046 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In492805046 256) 0))) (or (and (= ~y$w_buff0_used~0_In492805046 |ULTIMATE.start_main_#t~ite19_Out492805046|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out492805046|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In492805046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In492805046} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In492805046, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out492805046|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In492805046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:46:47,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In351983663 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In351983663 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In351983663 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In351983663 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out351983663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In351983663 |ULTIMATE.start_main_#t~ite20_Out351983663|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In351983663, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In351983663, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In351983663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351983663} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In351983663, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In351983663, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out351983663|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In351983663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351983663} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:46:47,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1692812323 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1692812323 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1692812323| ~y$r_buff0_thd0~0_In-1692812323)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1692812323| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1692812323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1692812323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1692812323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1692812323, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1692812323|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:46:47,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1563173322 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1563173322 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1563173322 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1563173322 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out1563173322| ~y$r_buff1_thd0~0_In1563173322)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out1563173322| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1563173322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1563173322, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1563173322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563173322} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1563173322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1563173322, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1563173322, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1563173322|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563173322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:46:47,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2113857166 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In2113857166 |ULTIMATE.start_main_#t~ite35_Out2113857166|) (= |ULTIMATE.start_main_#t~ite34_In2113857166| |ULTIMATE.start_main_#t~ite34_Out2113857166|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2113857166 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2113857166 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2113857166 256))) (= 0 (mod ~y$w_buff0_used~0_In2113857166 256)))) (= ~y$w_buff0_used~0_In2113857166 |ULTIMATE.start_main_#t~ite34_Out2113857166|) (= |ULTIMATE.start_main_#t~ite34_Out2113857166| |ULTIMATE.start_main_#t~ite35_Out2113857166|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2113857166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2113857166, ~weak$$choice2~0=~weak$$choice2~0_In2113857166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2113857166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2113857166, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In2113857166|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2113857166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2113857166, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2113857166|, ~weak$$choice2~0=~weak$$choice2~0_In2113857166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2113857166, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2113857166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2113857166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 18:46:47,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 18:46:47,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:46:47,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:46:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:46:47 BasicIcfg [2019-12-27 18:46:47,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:46:47,470 INFO L168 Benchmark]: Toolchain (without parser) took 24374.52 ms. Allocated memory was 144.2 MB in the beginning and 849.3 MB in the end (delta: 705.2 MB). Free memory was 99.1 MB in the beginning and 736.5 MB in the end (delta: -637.4 MB). Peak memory consumption was 623.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,471 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.13 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 98.7 MB in the beginning and 153.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.03 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,473 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,474 INFO L168 Benchmark]: RCFGBuilder took 791.46 ms. Allocated memory is still 199.8 MB. Free memory was 147.5 MB in the beginning and 103.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,475 INFO L168 Benchmark]: TraceAbstraction took 22693.87 ms. Allocated memory was 199.8 MB in the beginning and 849.3 MB in the end (delta: 649.6 MB). Free memory was 103.7 MB in the beginning and 736.5 MB in the end (delta: -632.8 MB). Peak memory consumption was 572.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:47,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.13 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 98.7 MB in the beginning and 153.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.03 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.19 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.46 ms. Allocated memory is still 199.8 MB. Free memory was 147.5 MB in the beginning and 103.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22693.87 ms. Allocated memory was 199.8 MB in the beginning and 849.3 MB in the end (delta: 649.6 MB). Free memory was 103.7 MB in the beginning and 736.5 MB in the end (delta: -632.8 MB). Peak memory consumption was 572.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1954 SDtfs, 2303 SDslu, 5375 SDs, 0 SdLazy, 4249 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 47 SyntacticMatches, 26 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 14543 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 107870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...