/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/mix034_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:48:54,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:48:54,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:48:54,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:48:54,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:48:54,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:48:54,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:48:54,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:48:54,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:48:54,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:48:54,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:48:54,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:48:54,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:48:54,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:48:54,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:48:54,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:48:54,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:48:54,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:48:54,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:48:54,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:48:54,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:48:54,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:48:54,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:48:54,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:48:54,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:48:54,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:48:54,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:48:54,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:48:54,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:48:54,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:48:54,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:48:54,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:48:54,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:48:54,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:48:54,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:48:54,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:48:54,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:48:54,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:48:54,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:48:54,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:48:54,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:48:54,908 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 16:48:54,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:48:54,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:48:54,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:48:54,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:48:54,929 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:48:54,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:48:54,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:48:54,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:48:54,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:48:54,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:48:54,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:48:54,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:48:54,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:48:54,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:48:54,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:48:54,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:48:54,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:48:54,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:48:54,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:48:54,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:48:54,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:48:54,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:54,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:48:54,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:48:54,935 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:48:54,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:48:55,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:48:55,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:48:55,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:48:55,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:48:55,216 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:48:55,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-27 16:48:55,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a229de/3820df83a5d446479853251c4f17468d/FLAG79d344b46 [2019-12-27 16:48:55,848 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:48:55,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-27 16:48:55,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a229de/3820df83a5d446479853251c4f17468d/FLAG79d344b46 [2019-12-27 16:48:56,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a229de/3820df83a5d446479853251c4f17468d [2019-12-27 16:48:56,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:48:56,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:48:56,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:56,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:48:56,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:48:56,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:56,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f5886b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56, skipping insertion in model container [2019-12-27 16:48:56,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:56,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:48:56,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:48:56,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:56,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:48:56,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:56,950 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:48:56,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56 WrapperNode [2019-12-27 16:48:56,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:56,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:56,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:48:56,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:48:56,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:56,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:57,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:48:57,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:48:57,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:48:57,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (1/1) ... [2019-12-27 16:48:57,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:48:57,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:48:57,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:48:57,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:48:57,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (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 16:48:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:48:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:48:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:48:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:48:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:48:57,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:48:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:48:57,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:48:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:48:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:48:57,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:48:57,140 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 16:48:57,877 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:48:57,877 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:48:57,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:57 BoogieIcfgContainer [2019-12-27 16:48:57,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:48:57,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:48:57,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:48:57,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:48:57,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:48:56" (1/3) ... [2019-12-27 16:48:57,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcc8c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:57, skipping insertion in model container [2019-12-27 16:48:57,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:56" (2/3) ... [2019-12-27 16:48:57,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcc8c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:57, skipping insertion in model container [2019-12-27 16:48:57,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:57" (3/3) ... [2019-12-27 16:48:57,888 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc.i [2019-12-27 16:48:57,898 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:48:57,899 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:48:57,907 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:48:57,908 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:48:57,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:58,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:48:58,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:48:58,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:48:58,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:48:58,061 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:48:58,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:48:58,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:48:58,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:48:58,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:48:58,086 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 16:48:58,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:58,192 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:58,192 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:58,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:58,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:58,281 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:58,282 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:58,290 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:58,306 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:48:58,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:49:01,052 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-27 16:49:03,353 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 16:49:03,468 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:49:03,697 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 16:49:03,697 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 16:49:03,701 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 16:49:04,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 16:49:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 16:49:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:49:04,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:04,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:49:04,221 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 16:49:04,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207689019] [2019-12-27 16:49:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:04,423 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 16:49:04,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207689019] [2019-12-27 16:49:04,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:04,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:04,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046417354] [2019-12-27 16:49:04,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:04,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:04,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:49:04,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:04,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:04,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:04,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:04,467 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 16:49:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:04,681 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 16:49:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:04,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:49:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:04,787 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 16:49:04,788 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 16:49:04,789 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 16:49:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 16:49:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 16:49:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 16:49:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 16:49:05,290 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 16:49:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:05,291 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 16:49:05,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 16:49:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:49:05,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:05,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 16:49:05,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652341500] [2019-12-27 16:49:05,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:05,355 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 16:49:05,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652341500] [2019-12-27 16:49:05,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:05,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:05,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105655512] [2019-12-27 16:49:05,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:05,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:05,360 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:49:05,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:05,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:05,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:05,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:05,363 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 16:49:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:05,408 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 16:49:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:49:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:05,419 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 16:49:05,419 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 16:49:05,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 16:49:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 16:49:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 16:49:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 16:49:05,456 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 16:49:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:05,456 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 16:49:05,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 16:49:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:05,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:05,466 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 16:49:05,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061560817] [2019-12-27 16:49:05,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:05,536 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 16:49:05,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061560817] [2019-12-27 16:49:05,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:05,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:05,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436370937] [2019-12-27 16:49:05,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:05,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:05,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:05,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:05,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:05,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:05,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:05,544 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 16:49:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:05,606 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 16:49:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:05,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:49:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:05,618 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 16:49:05,618 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 16:49:05,618 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 16:49:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 16:49:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 16:49:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 16:49:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 16:49:05,658 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 16:49:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:05,659 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 16:49:05,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 16:49:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:05,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:05,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 16:49:05,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329941601] [2019-12-27 16:49:05,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:05,724 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 16:49:05,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329941601] [2019-12-27 16:49:05,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:05,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:05,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067586259] [2019-12-27 16:49:05,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:05,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:05,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:05,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:05,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:05,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:49:05,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:49:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:49:05,731 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 16:49:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:05,920 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 16:49:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:05,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:49:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:05,932 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 16:49:05,932 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 16:49:05,932 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 16:49:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 16:49:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 16:49:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 16:49:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 16:49:05,978 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 16:49:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:05,978 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 16:49:05,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:49:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 16:49:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:05,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:05,979 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 16:49:05,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632004249] [2019-12-27 16:49:05,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:06,060 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 16:49:06,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632004249] [2019-12-27 16:49:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:06,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:06,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401579787] [2019-12-27 16:49:06,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:06,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:06,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:49:06,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:06,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:06,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:49:06,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:49:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:49:06,067 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 16:49:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,239 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 16:49:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:06,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:49:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,250 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 16:49:06,251 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 16:49:06,251 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 16:49:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 16:49:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 16:49:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 16:49:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 16:49:06,296 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 16:49:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:06,297 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 16:49:06,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:49:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 16:49:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:49:06,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:06,299 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] [2019-12-27 16:49:06,300 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 16:49:06,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:06,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574692721] [2019-12-27 16:49:06,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:06,426 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 16:49:06,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574692721] [2019-12-27 16:49:06,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:06,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:06,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [45267096] [2019-12-27 16:49:06,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:06,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:06,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 16:49:06,439 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:06,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:06,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:06,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:06,441 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 16:49:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,709 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 16:49:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:06,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:49:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,733 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 16:49:06,733 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 16:49:06,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:49:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 16:49:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 16:49:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 16:49:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 16:49:06,856 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 16:49:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 16:49:06,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 16:49:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:06,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:06,860 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] [2019-12-27 16:49:06,860 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 16:49:06,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:06,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002600441] [2019-12-27 16:49:06,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:06,937 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 16:49:06,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002600441] [2019-12-27 16:49:06,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:06,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:06,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527143452] [2019-12-27 16:49:06,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:06,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:06,955 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:49:06,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:06,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:06,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:06,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:06,961 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 16:49:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,977 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 16:49:06,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:06,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:49:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,993 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 16:49:06,994 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 16:49:06,994 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 16:49:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 16:49:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 16:49:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 16:49:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 16:49:07,041 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 16:49:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:07,042 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 16:49:07,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 16:49:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:07,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:07,045 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] [2019-12-27 16:49:07,045 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 16:49:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486097384] [2019-12-27 16:49:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:07,155 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 16:49:07,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486097384] [2019-12-27 16:49:07,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:07,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:07,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792215412] [2019-12-27 16:49:07,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:07,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:07,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:49:07,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:07,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:07,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:07,172 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 16:49:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:07,428 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-27 16:49:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:07,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:49:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:07,436 INFO L225 Difference]: With dead ends: 2378 [2019-12-27 16:49:07,437 INFO L226 Difference]: Without dead ends: 2378 [2019-12-27 16:49:07,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:49:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-27 16:49:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-27 16:49:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-27 16:49:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-27 16:49:07,489 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-27 16:49:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:07,490 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-27 16:49:07,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-27 16:49:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:49:07,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:07,493 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] [2019-12-27 16:49:07,493 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 16:49:07,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:07,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658454708] [2019-12-27 16:49:07,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:07,590 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 16:49:07,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658454708] [2019-12-27 16:49:07,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:07,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:49:07,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006994818] [2019-12-27 16:49:07,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:07,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:07,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 16:49:07,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:07,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:07,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:49:07,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:07,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:49:07,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:49:07,757 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 8 states. [2019-12-27 16:49:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:08,445 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-27 16:49:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:49:08,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 16:49:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:08,456 INFO L225 Difference]: With dead ends: 2697 [2019-12-27 16:49:08,456 INFO L226 Difference]: Without dead ends: 2697 [2019-12-27 16:49:08,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:49:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-27 16:49:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-27 16:49:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-27 16:49:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-27 16:49:08,507 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-27 16:49:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:08,508 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-27 16:49:08,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:49:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-27 16:49:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:49:08,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:08,512 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] [2019-12-27 16:49:08,513 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 16:49:08,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:08,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299346340] [2019-12-27 16:49:08,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:08,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 16:49:08,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299346340] [2019-12-27 16:49:08,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:08,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:08,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131172960] [2019-12-27 16:49:08,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:08,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:08,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:49:08,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:08,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:08,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:08,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:08,618 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 5 states. [2019-12-27 16:49:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:08,637 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-27 16:49:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:49:08,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:49:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:08,641 INFO L225 Difference]: With dead ends: 1330 [2019-12-27 16:49:08,641 INFO L226 Difference]: Without dead ends: 1330 [2019-12-27 16:49:08,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-27 16:49:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-27 16:49:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 16:49:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-27 16:49:08,665 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-27 16:49:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:08,666 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-27 16:49:08,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-27 16:49:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:49:08,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:08,671 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] [2019-12-27 16:49:08,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 16:49:08,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:08,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782137469] [2019-12-27 16:49:08,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:08,796 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 16:49:08,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782137469] [2019-12-27 16:49:08,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:08,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:49:08,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536154952] [2019-12-27 16:49:08,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:08,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:08,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 130 transitions. [2019-12-27 16:49:08,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:08,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:08,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:49:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:49:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:49:08,979 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 10 states. [2019-12-27 16:49:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:09,457 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-27 16:49:09,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:49:09,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 16:49:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:09,463 INFO L225 Difference]: With dead ends: 3273 [2019-12-27 16:49:09,464 INFO L226 Difference]: Without dead ends: 2143 [2019-12-27 16:49:09,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:49:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-27 16:49:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-27 16:49:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-27 16:49:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-27 16:49:09,503 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-27 16:49:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:09,503 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-27 16:49:09,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:49:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-27 16:49:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:49:09,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:09,507 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] [2019-12-27 16:49:09,507 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 16:49:09,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:09,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609151438] [2019-12-27 16:49:09,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:09,565 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 16:49:09,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609151438] [2019-12-27 16:49:09,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:09,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:09,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [8131587] [2019-12-27 16:49:09,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:09,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:09,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 150 transitions. [2019-12-27 16:49:09,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:09,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:09,740 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-27 16:49:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:09,797 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-27 16:49:09,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:09,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 16:49:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:09,802 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 16:49:09,803 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 16:49:09,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 16:49:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 16:49:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-27 16:49:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-27 16:49:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-27 16:49:09,834 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-27 16:49:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:09,835 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-27 16:49:09,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-27 16:49:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:49:09,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:09,839 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] [2019-12-27 16:49:09,839 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 16:49:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844341138] [2019-12-27 16:49:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:09,944 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 16:49:09,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844341138] [2019-12-27 16:49:09,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:09,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546352875] [2019-12-27 16:49:09,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:09,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:10,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 99 transitions. [2019-12-27 16:49:10,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:10,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:10,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:10,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:10,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:10,011 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 3 states. [2019-12-27 16:49:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:10,026 INFO L93 Difference]: Finished difference Result 1343 states and 2922 transitions. [2019-12-27 16:49:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:10,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:49:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:10,031 INFO L225 Difference]: With dead ends: 1343 [2019-12-27 16:49:10,031 INFO L226 Difference]: Without dead ends: 1343 [2019-12-27 16:49:10,032 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 16:49:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-12-27 16:49:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1122. [2019-12-27 16:49:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-12-27 16:49:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2495 transitions. [2019-12-27 16:49:10,068 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2495 transitions. Word has length 51 [2019-12-27 16:49:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:10,068 INFO L462 AbstractCegarLoop]: Abstraction has 1122 states and 2495 transitions. [2019-12-27 16:49:10,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2495 transitions. [2019-12-27 16:49:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:49:10,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:10,072 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 16:49:10,072 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 16:49:10,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:10,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614745400] [2019-12-27 16:49:10,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:10,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:49:10,245 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:49:10,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t909~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t909~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35|) |v_ULTIMATE.start_main_~#t909~0.offset_24| 0)) |v_#memory_int_15|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t909~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_~#t909~0.offset=|v_ULTIMATE.start_main_~#t909~0.offset_24|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t909~0.base=|v_ULTIMATE.start_main_~#t909~0.base_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t909~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t909~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t910~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:49:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13|) |v_ULTIMATE.start_main_~#t910~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t910~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13| 1) |v_#valid_29|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t910~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t910~0.offset_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t910~0.base_13| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_~#t910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:49:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_In-268042020 ~z$w_buff1_used~0_Out-268042020) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-268042020| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-268042020) (= |P0Thread1of1ForFork0_#in~arg.base_In-268042020| P0Thread1of1ForFork0_~arg.base_Out-268042020) (= (mod ~z$w_buff1_used~0_Out-268042020 256) 0) (= ~z$w_buff0~0_Out-268042020 1) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-268042020|) (= P0Thread1of1ForFork0_~arg.offset_Out-268042020 |P0Thread1of1ForFork0_#in~arg.offset_In-268042020|) (= ~z$w_buff0_used~0_Out-268042020 1) (= ~z$w_buff1~0_Out-268042020 ~z$w_buff0~0_In-268042020)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-268042020|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-268042020, ~z$w_buff0~0=~z$w_buff0~0_In-268042020, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-268042020|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-268042020|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-268042020, ~z$w_buff0~0=~z$w_buff0~0_Out-268042020, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-268042020, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-268042020, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-268042020|, ~z$w_buff1~0=~z$w_buff1~0_Out-268042020, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-268042020, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-268042020|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-268042020} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:49:10,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In988782208 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In988782208 256)))) (or (= (mod ~z$w_buff0_used~0_In988782208 256) 0) (and .cse0 (= (mod ~z$r_buff1_thd2~0_In988782208 256) 0)) (and .cse0 (= (mod ~z$w_buff1_used~0_In988782208 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite24_Out988782208| |P1Thread1of1ForFork1_#t~ite23_Out988782208|) .cse1 (= ~z$w_buff1_used~0_In988782208 |P1Thread1of1ForFork1_#t~ite23_Out988782208|)) (and (= ~z$w_buff1_used~0_In988782208 |P1Thread1of1ForFork1_#t~ite24_Out988782208|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In988782208| |P1Thread1of1ForFork1_#t~ite23_Out988782208|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In988782208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In988782208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In988782208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In988782208|, ~weak$$choice2~0=~weak$$choice2~0_In988782208, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In988782208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In988782208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In988782208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out988782208|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In988782208, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out988782208|, ~weak$$choice2~0=~weak$$choice2~0_In988782208, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In988782208} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:49:10,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:49:10,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:49:10,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1977920467 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1977920467 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1977920467 |P0Thread1of1ForFork0_#t~ite5_Out-1977920467|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1977920467|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1977920467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1977920467} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1977920467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1977920467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1977920467} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:49:10,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In333452424 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In333452424 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In333452424 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In333452424 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out333452424| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out333452424| ~z$w_buff1_used~0_In333452424) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In333452424, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In333452424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In333452424, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In333452424} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out333452424|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In333452424, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In333452424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In333452424, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In333452424} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:49:10,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In386014167 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In386014167 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out386014167) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In386014167 ~z$r_buff0_thd1~0_Out386014167)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In386014167, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In386014167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In386014167, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out386014167|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out386014167} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:49:10,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1364943597 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1364943597 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1364943597 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1364943597 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1364943597|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1364943597 |P0Thread1of1ForFork0_#t~ite8_Out-1364943597|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1364943597, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1364943597, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1364943597, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1364943597} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1364943597, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1364943597|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1364943597, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1364943597, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1364943597} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:49:10,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-552376404 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-552376404 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-552376404| |P1Thread1of1ForFork1_#t~ite33_Out-552376404|))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-552376404| ~z~0_In-552376404) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-552376404| ~z$w_buff1~0_In-552376404) (not .cse1) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-552376404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552376404, ~z$w_buff1~0=~z$w_buff1~0_In-552376404, ~z~0=~z~0_In-552376404} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-552376404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552376404, ~z$w_buff1~0=~z$w_buff1~0_In-552376404, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-552376404|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-552376404|, ~z~0=~z~0_In-552376404} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:49:10,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In830039376 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In830039376 256) 0))) (or (and (= ~z$w_buff0_used~0_In830039376 |P1Thread1of1ForFork1_#t~ite34_Out830039376|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out830039376|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In830039376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830039376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In830039376, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out830039376|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830039376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:49:10,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2011296540 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In2011296540 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In2011296540 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In2011296540 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2011296540| ~z$w_buff1_used~0_In2011296540) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out2011296540| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2011296540, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011296540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011296540, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011296540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2011296540, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011296540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011296540, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2011296540|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011296540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:49:10,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In403421723 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In403421723 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out403421723|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In403421723 |P1Thread1of1ForFork1_#t~ite36_Out403421723|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In403421723, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In403421723} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In403421723, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In403421723, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out403421723|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:49:10,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1599122876 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1599122876 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1599122876 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1599122876 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1599122876| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-1599122876| ~z$r_buff1_thd2~0_In-1599122876) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1599122876, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1599122876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1599122876, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1599122876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1599122876, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1599122876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1599122876, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1599122876, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1599122876|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:49:10,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:49:10,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:49:10,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:49:10,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-552790155 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-552790155 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-552790155| ~z~0_In-552790155)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-552790155| ~z$w_buff1~0_In-552790155) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-552790155, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552790155, ~z$w_buff1~0=~z$w_buff1~0_In-552790155, ~z~0=~z~0_In-552790155} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-552790155|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-552790155, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552790155, ~z$w_buff1~0=~z$w_buff1~0_In-552790155, ~z~0=~z~0_In-552790155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:49:10,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 16:49:10,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1045708478 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1045708478 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1045708478|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1045708478 |ULTIMATE.start_main_#t~ite42_Out-1045708478|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1045708478, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045708478} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1045708478, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045708478, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1045708478|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:49:10,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1897245204 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1897245204 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1897245204 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1897245204 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1897245204 |ULTIMATE.start_main_#t~ite43_Out1897245204|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1897245204|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1897245204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1897245204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1897245204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897245204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1897245204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1897245204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1897245204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897245204, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1897245204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:49:10,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2144044455 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2144044455 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-2144044455|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2144044455 |ULTIMATE.start_main_#t~ite44_Out-2144044455|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144044455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144044455} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144044455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144044455, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2144044455|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:49:10,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1729854623 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1729854623 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1729854623 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1729854623 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1729854623|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1729854623| ~z$r_buff1_thd0~0_In-1729854623) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1729854623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1729854623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1729854623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1729854623} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1729854623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1729854623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1729854623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1729854623, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1729854623|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:49:10,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:49:10,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:49:10 BasicIcfg [2019-12-27 16:49:10,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:49:10,357 INFO L168 Benchmark]: Toolchain (without parser) took 14225.28 ms. Allocated memory was 138.9 MB in the beginning and 439.4 MB in the end (delta: 300.4 MB). Free memory was 100.7 MB in the beginning and 92.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 308.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,357 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:49:10,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.06 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 158.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,360 INFO L168 Benchmark]: Boogie Preprocessor took 38.24 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,361 INFO L168 Benchmark]: RCFGBuilder took 820.89 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,367 INFO L168 Benchmark]: TraceAbstraction took 12474.92 ms. Allocated memory was 203.9 MB in the beginning and 439.4 MB in the end (delta: 235.4 MB). Free memory was 108.0 MB in the beginning and 92.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 250.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:10,372 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.17 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.06 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 158.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.24 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.89 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12474.92 ms. Allocated memory was 203.9 MB in the beginning and 439.4 MB in the end (delta: 235.4 MB). Free memory was 108.0 MB in the beginning and 92.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 250.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1638 SDtfs, 1343 SDslu, 3454 SDs, 0 SdLazy, 1464 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3470 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 29091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...