/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:56:44,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:56:44,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:56:44,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:56:44,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:56:44,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:56:44,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:56:44,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:56:44,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:56:44,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:56:44,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:56:44,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:56:44,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:56:44,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:56:44,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:56:44,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:56:44,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:56:44,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:56:44,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:56:44,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:56:44,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:56:44,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:56:44,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:56:44,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:56:44,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:56:44,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:56:44,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:56:44,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:56:44,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:56:44,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:56:44,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:56:44,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:56:44,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:56:44,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:56:44,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:56:44,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:56:44,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:56:44,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:56:44,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:56:44,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:56:44,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:56:44,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:56:44,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:56:44,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:56:44,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:56:44,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:56:44,929 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:56:44,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:56:44,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:56:44,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:56:44,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:56:44,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:56:44,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:56:44,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:56:44,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:56:44,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:56:44,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:56:44,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:56:44,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:56:44,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:56:44,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:56:44,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:56:44,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:56:44,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:56:44,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:56:44,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:56:44,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:56:44,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:56:44,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:56:44,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:56:44,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:56:44,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:56:45,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:56:45,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:56:45,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:56:45,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:56:45,234 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:56:45,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-26 23:56:45,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33c184a1/0646afad933a4b30a56042bcb8ee010b/FLAGacf0b8571 [2019-12-26 23:56:45,833 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:56:45,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-26 23:56:45,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33c184a1/0646afad933a4b30a56042bcb8ee010b/FLAGacf0b8571 [2019-12-26 23:56:46,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33c184a1/0646afad933a4b30a56042bcb8ee010b [2019-12-26 23:56:46,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:56:46,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:56:46,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:56:46,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:56:46,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:56:46,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:46,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3661cc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46, skipping insertion in model container [2019-12-26 23:56:46,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:46,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:56:46,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:56:46,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:56:46,788 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:56:46,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:56:46,972 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:56:46,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46 WrapperNode [2019-12-26 23:56:46,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:56:46,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:56:46,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:56:46,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:56:46,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:56:47,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:56:47,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:56:47,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:56:47,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (1/1) ... [2019-12-26 23:56:47,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:56:47,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:56:47,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:56:47,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:56:47,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (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-26 23:56:47,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:56:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:56:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:56:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:56:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:56:47,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:56:47,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:56:47,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:56:47,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:56:47,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:56:47,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:56:47,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:56:47,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:56:47,164 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:56:47,944 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:56:47,945 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:56:47,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:56:47 BoogieIcfgContainer [2019-12-26 23:56:47,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:56:47,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:56:47,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:56:47,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:56:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:56:46" (1/3) ... [2019-12-26 23:56:47,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211d1c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:56:47, skipping insertion in model container [2019-12-26 23:56:47,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:56:46" (2/3) ... [2019-12-26 23:56:47,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211d1c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:56:47, skipping insertion in model container [2019-12-26 23:56:47,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:56:47" (3/3) ... [2019-12-26 23:56:47,957 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-26 23:56:47,968 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:56:47,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:56:47,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:56:47,977 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:56:48,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,022 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,022 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,070 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,071 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,111 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,118 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:56:48,145 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:56:48,162 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:56:48,162 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:56:48,163 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:56:48,163 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:56:48,163 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:56:48,163 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:56:48,163 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:56:48,163 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:56:48,189 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 23:56:48,191 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:56:48,323 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:56:48,323 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:56:48,342 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:56:48,366 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:56:48,463 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:56:48,463 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:56:48,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:56:48,496 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 23:56:48,497 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:56:53,978 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:56:54,100 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:56:54,435 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-26 23:56:54,435 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 23:56:54,464 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-26 23:57:11,936 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-26 23:57:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-26 23:57:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:57:11,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:11,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:57:11,945 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-26 23:57:11,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:11,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064925851] [2019-12-26 23:57:11,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:12,163 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-26 23:57:12,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064925851] [2019-12-26 23:57:12,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:12,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:57:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497701477] [2019-12-26 23:57:12,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:12,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:12,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:12,191 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-26 23:57:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:13,539 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-26 23:57:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:57:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:14,097 INFO L225 Difference]: With dead ends: 110910 [2019-12-26 23:57:14,097 INFO L226 Difference]: Without dead ends: 98066 [2019-12-26 23:57:14,099 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-26 23:57:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-26 23:57:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-26 23:57:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-26 23:57:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-26 23:57:25,357 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-26 23:57:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:25,358 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-26 23:57:25,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-26 23:57:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:57:25,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:25,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:25,363 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-26 23:57:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:25,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886915891] [2019-12-26 23:57:25,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:57:25,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886915891] [2019-12-26 23:57:25,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:25,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:25,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463625602] [2019-12-26 23:57:25,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:25,479 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-26 23:57:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:26,665 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-26 23:57:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:57:26,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:57:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:32,405 INFO L225 Difference]: With dead ends: 156656 [2019-12-26 23:57:32,405 INFO L226 Difference]: Without dead ends: 156558 [2019-12-26 23:57:32,406 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-26 23:57:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-26 23:57:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-26 23:57:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-26 23:57:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-26 23:57:40,267 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-26 23:57:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-26 23:57:40,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-26 23:57:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:57:40,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:40,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:40,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-26 23:57:40,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:40,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710365483] [2019-12-26 23:57:40,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:40,354 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-26 23:57:40,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710365483] [2019-12-26 23:57:40,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:40,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:40,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742189561] [2019-12-26 23:57:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:40,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:40,358 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-26 23:57:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:40,489 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-26 23:57:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:40,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:57:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:40,555 INFO L225 Difference]: With dead ends: 31386 [2019-12-26 23:57:40,556 INFO L226 Difference]: Without dead ends: 31386 [2019-12-26 23:57:40,556 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-26 23:57:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-26 23:57:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-26 23:57:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-26 23:57:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-26 23:57:45,619 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-26 23:57:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:45,620 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-26 23:57:45,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-26 23:57:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:57:45,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:45,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:45,623 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-26 23:57:45,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:45,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608627070] [2019-12-26 23:57:45,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:45,764 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-26 23:57:45,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608627070] [2019-12-26 23:57:45,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:45,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:57:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692309867] [2019-12-26 23:57:45,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:57:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:57:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:45,766 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-26 23:57:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:46,227 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-26 23:57:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:57:46,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 23:57:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:46,291 INFO L225 Difference]: With dead ends: 43205 [2019-12-26 23:57:46,292 INFO L226 Difference]: Without dead ends: 43205 [2019-12-26 23:57:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-26 23:57:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-26 23:57:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-26 23:57:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-26 23:57:46,959 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-26 23:57:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:46,961 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-26 23:57:46,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:57:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-26 23:57:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:57:46,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:46,972 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] [2019-12-26 23:57:46,972 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-26 23:57:46,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:46,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384295845] [2019-12-26 23:57:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:47,087 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-26 23:57:47,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384295845] [2019-12-26 23:57:47,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:47,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:57:47,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576838957] [2019-12-26 23:57:47,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:57:47,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:57:47,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:57:47,089 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-26 23:57:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:48,303 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-26 23:57:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:57:48,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:57:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:48,389 INFO L225 Difference]: With dead ends: 56051 [2019-12-26 23:57:48,389 INFO L226 Difference]: Without dead ends: 56037 [2019-12-26 23:57:48,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:57:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-26 23:57:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-26 23:57:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-26 23:57:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-26 23:57:49,142 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-26 23:57:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:49,143 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-26 23:57:49,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:57:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-26 23:57:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:57:49,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:49,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:49,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-26 23:57:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249325806] [2019-12-26 23:57:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:49,219 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-26 23:57:49,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249325806] [2019-12-26 23:57:49,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:49,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:57:49,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218332622] [2019-12-26 23:57:49,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:49,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:49,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:49,222 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-26 23:57:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:49,282 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-26 23:57:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:57:49,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:57:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:49,304 INFO L225 Difference]: With dead ends: 15281 [2019-12-26 23:57:49,304 INFO L226 Difference]: Without dead ends: 15281 [2019-12-26 23:57:49,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-26 23:57:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-26 23:57:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-26 23:57:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-26 23:57:49,855 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-26 23:57:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:49,855 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-26 23:57:49,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-26 23:57:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:57:49,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:49,865 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-26 23:57:49,866 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-26 23:57:49,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:49,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114046610] [2019-12-26 23:57:49,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:49,952 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-26 23:57:49,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114046610] [2019-12-26 23:57:49,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:49,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:57:49,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361393335] [2019-12-26 23:57:49,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:57:49,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:57:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:57:49,955 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-26 23:57:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:50,487 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-26 23:57:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:57:50,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 23:57:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:50,517 INFO L225 Difference]: With dead ends: 21679 [2019-12-26 23:57:50,517 INFO L226 Difference]: Without dead ends: 21679 [2019-12-26 23:57:50,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:57:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-26 23:57:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-26 23:57:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-26 23:57:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-26 23:57:50,811 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-26 23:57:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:50,811 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-26 23:57:50,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:57:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-26 23:57:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:57:50,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:50,829 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] [2019-12-26 23:57:50,829 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-26 23:57:50,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:50,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317457121] [2019-12-26 23:57:50,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:50,946 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-26 23:57:50,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317457121] [2019-12-26 23:57:50,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:50,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:57:50,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798453531] [2019-12-26 23:57:50,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:57:50,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:57:50,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:50,948 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-26 23:57:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:52,209 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-26 23:57:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:57:52,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 23:57:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:52,247 INFO L225 Difference]: With dead ends: 24589 [2019-12-26 23:57:52,248 INFO L226 Difference]: Without dead ends: 24589 [2019-12-26 23:57:52,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:57:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-26 23:57:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-26 23:57:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-26 23:57:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-26 23:57:52,564 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-26 23:57:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:52,564 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-26 23:57:52,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:57:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-26 23:57:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:57:52,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:52,588 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] [2019-12-26 23:57:52,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-26 23:57:52,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:52,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575332993] [2019-12-26 23:57:52,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:52,657 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-26 23:57:52,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575332993] [2019-12-26 23:57:52,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:52,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:57:52,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506534552] [2019-12-26 23:57:52,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:52,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:52,660 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-26 23:57:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:52,737 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-26 23:57:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:52,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 23:57:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:52,775 INFO L225 Difference]: With dead ends: 16665 [2019-12-26 23:57:52,776 INFO L226 Difference]: Without dead ends: 16665 [2019-12-26 23:57:52,776 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-26 23:57:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-26 23:57:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-26 23:57:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-26 23:57:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-26 23:57:53,358 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-26 23:57:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:53,359 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-26 23:57:53,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-26 23:57:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:57:53,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:53,379 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] [2019-12-26 23:57:53,379 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-26 23:57:53,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:53,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780914878] [2019-12-26 23:57:53,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:53,444 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-26 23:57:53,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780914878] [2019-12-26 23:57:53,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:53,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:57:53,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707206849] [2019-12-26 23:57:53,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:57:53,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:57:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:57:53,447 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-26 23:57:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:53,588 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-26 23:57:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:57:53,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 23:57:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:53,619 INFO L225 Difference]: With dead ends: 31503 [2019-12-26 23:57:53,619 INFO L226 Difference]: Without dead ends: 16332 [2019-12-26 23:57:53,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-26 23:57:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-26 23:57:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-26 23:57:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-26 23:57:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-26 23:57:53,891 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-26 23:57:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:53,891 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-26 23:57:53,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:57:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-26 23:57:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:57:53,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:53,910 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] [2019-12-26 23:57:53,910 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-26 23:57:53,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:53,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531296144] [2019-12-26 23:57:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:53,996 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-26 23:57:53,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531296144] [2019-12-26 23:57:53,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:53,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:57:53,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035865996] [2019-12-26 23:57:53,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:57:53,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:57:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:53,998 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-26 23:57:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:54,604 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-26 23:57:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:57:54,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:57:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:54,635 INFO L225 Difference]: With dead ends: 22499 [2019-12-26 23:57:54,635 INFO L226 Difference]: Without dead ends: 22499 [2019-12-26 23:57:54,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:57:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-26 23:57:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-26 23:57:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-26 23:57:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-26 23:57:54,953 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-26 23:57:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:54,953 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-26 23:57:54,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:57:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-26 23:57:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:57:54,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:54,972 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] [2019-12-26 23:57:54,972 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-26 23:57:54,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:54,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669278267] [2019-12-26 23:57:54,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:55,030 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-26 23:57:55,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669278267] [2019-12-26 23:57:55,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:55,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:57:55,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527655463] [2019-12-26 23:57:55,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:57:55,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:57:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:57:55,032 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-26 23:57:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:55,125 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-26 23:57:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:57:55,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:57:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:55,153 INFO L225 Difference]: With dead ends: 19781 [2019-12-26 23:57:55,154 INFO L226 Difference]: Without dead ends: 19287 [2019-12-26 23:57:55,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 23:57:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-26 23:57:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-26 23:57:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-26 23:57:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-26 23:57:55,435 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-26 23:57:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:55,435 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-26 23:57:55,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:57:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-26 23:57:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:57:55,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:55,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:55,692 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-26 23:57:55,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:55,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305308617] [2019-12-26 23:57:55,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:55,747 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-26 23:57:55,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305308617] [2019-12-26 23:57:55,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:55,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:57:55,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222296191] [2019-12-26 23:57:55,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:57:55,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:57:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:57:55,749 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-26 23:57:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:55,879 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-26 23:57:55,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:57:55,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:57:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:55,923 INFO L225 Difference]: With dead ends: 27408 [2019-12-26 23:57:55,923 INFO L226 Difference]: Without dead ends: 27408 [2019-12-26 23:57:55,923 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-26 23:57:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-26 23:57:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-26 23:57:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-26 23:57:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-26 23:57:56,309 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-26 23:57:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:56,309 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-26 23:57:56,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:57:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-26 23:57:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:57:56,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:56,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:56,342 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-26 23:57:56,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:56,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125343738] [2019-12-26 23:57:56,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:56,439 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-26 23:57:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125343738] [2019-12-26 23:57:56,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:56,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:57:56,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725578467] [2019-12-26 23:57:56,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:57:56,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:57:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:56,441 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-26 23:57:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:56,979 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-26 23:57:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:57:56,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:57:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:57,037 INFO L225 Difference]: With dead ends: 61323 [2019-12-26 23:57:57,038 INFO L226 Difference]: Without dead ends: 42147 [2019-12-26 23:57:57,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:57:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-26 23:57:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-26 23:57:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-26 23:57:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-26 23:57:57,543 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-26 23:57:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:57,544 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-26 23:57:57,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:57:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-26 23:57:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:57:57,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:57,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:57,571 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-26 23:57:57,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:57,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407089165] [2019-12-26 23:57:57,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:57,670 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-26 23:57:57,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407089165] [2019-12-26 23:57:57,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:57,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:57:57,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761792706] [2019-12-26 23:57:57,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:57:57,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:57:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:57,673 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-26 23:57:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:58,578 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-26 23:57:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:57:58,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:57:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:57:58,669 INFO L225 Difference]: With dead ends: 68574 [2019-12-26 23:57:58,669 INFO L226 Difference]: Without dead ends: 51641 [2019-12-26 23:57:58,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:57:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-26 23:57:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-26 23:57:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-26 23:57:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-26 23:57:59,285 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-26 23:57:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:57:59,285 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-26 23:57:59,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:57:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-26 23:57:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:57:59,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:57:59,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:57:59,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:57:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:57:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-26 23:57:59,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:57:59,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450317085] [2019-12-26 23:57:59,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:57:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:57:59,402 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-26 23:57:59,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450317085] [2019-12-26 23:57:59,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:57:59,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:57:59,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696753842] [2019-12-26 23:57:59,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:57:59,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:57:59,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:57:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:57:59,406 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-26 23:57:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:57:59,931 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-26 23:57:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:57:59,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:57:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:00,014 INFO L225 Difference]: With dead ends: 58876 [2019-12-26 23:58:00,015 INFO L226 Difference]: Without dead ends: 51661 [2019-12-26 23:58:00,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:58:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-26 23:58:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-26 23:58:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-26 23:58:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-26 23:58:01,015 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-26 23:58:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:01,016 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-26 23:58:01,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-26 23:58:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:58:01,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:58:01,046 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-26 23:58:01,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:01,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014716401] [2019-12-26 23:58:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:01,114 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-26 23:58:01,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014716401] [2019-12-26 23:58:01,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:01,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:01,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36873180] [2019-12-26 23:58:01,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:01,117 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-26 23:58:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:01,341 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-26 23:58:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:01,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:58:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:01,433 INFO L225 Difference]: With dead ends: 33789 [2019-12-26 23:58:01,434 INFO L226 Difference]: Without dead ends: 33789 [2019-12-26 23:58:01,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 23:58:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-26 23:58:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-26 23:58:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-26 23:58:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-26 23:58:02,365 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-26 23:58:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:02,365 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-26 23:58:02,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-26 23:58:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:02,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:02,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:02,416 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:02,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-26 23:58:02,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:02,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388468259] [2019-12-26 23:58:02,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:02,468 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-26 23:58:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388468259] [2019-12-26 23:58:02,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:02,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:58:02,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764865513] [2019-12-26 23:58:02,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:58:02,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:58:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:58:02,474 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-26 23:58:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:02,818 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-26 23:58:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:58:02,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 23:58:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:02,883 INFO L225 Difference]: With dead ends: 45817 [2019-12-26 23:58:02,883 INFO L226 Difference]: Without dead ends: 45817 [2019-12-26 23:58:02,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-26 23:58:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-26 23:58:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-26 23:58:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-26 23:58:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-26 23:58:03,921 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-26 23:58:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:03,921 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-26 23:58:03,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:58:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-26 23:58:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:03,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:03,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:03,956 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-26 23:58:03,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:03,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399085575] [2019-12-26 23:58:03,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:04,049 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-26 23:58:04,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399085575] [2019-12-26 23:58:04,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:04,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:58:04,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862090760] [2019-12-26 23:58:04,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:04,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:04,052 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-26 23:58:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:04,590 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-26 23:58:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:58:04,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:04,689 INFO L225 Difference]: With dead ends: 69632 [2019-12-26 23:58:04,689 INFO L226 Difference]: Without dead ends: 63631 [2019-12-26 23:58:04,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:58:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-26 23:58:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-26 23:58:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-26 23:58:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-26 23:58:05,399 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-26 23:58:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:05,399 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-26 23:58:05,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-26 23:58:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:05,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:05,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:05,433 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-26 23:58:05,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:05,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803686680] [2019-12-26 23:58:05,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:05,584 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-26 23:58:05,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803686680] [2019-12-26 23:58:05,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:05,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:58:05,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420957693] [2019-12-26 23:58:05,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:05,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:05,586 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-26 23:58:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:06,400 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-26 23:58:06,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:58:06,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:06,463 INFO L225 Difference]: With dead ends: 44848 [2019-12-26 23:58:06,463 INFO L226 Difference]: Without dead ends: 44844 [2019-12-26 23:58:06,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:58:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-26 23:58:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-26 23:58:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-26 23:58:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-26 23:58:07,342 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-26 23:58:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:07,343 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-26 23:58:07,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-26 23:58:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:07,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:07,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:07,379 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:07,380 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-26 23:58:07,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:07,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107220166] [2019-12-26 23:58:07,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:07,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-26 23:58:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107220166] [2019-12-26 23:58:07,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:07,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:58:07,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000936386] [2019-12-26 23:58:07,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:07,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:07,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:07,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:07,425 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-26 23:58:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:07,685 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-26 23:58:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:07,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:58:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:07,747 INFO L225 Difference]: With dead ends: 43160 [2019-12-26 23:58:07,747 INFO L226 Difference]: Without dead ends: 43160 [2019-12-26 23:58:07,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-26 23:58:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-26 23:58:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-26 23:58:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-26 23:58:08,327 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-26 23:58:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:08,328 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-26 23:58:08,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-26 23:58:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:08,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:08,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:08,365 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-26 23:58:08,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:08,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666407017] [2019-12-26 23:58:08,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:08,463 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-26 23:58:08,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666407017] [2019-12-26 23:58:08,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:08,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:58:08,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259982984] [2019-12-26 23:58:08,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:58:08,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:58:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:08,467 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-26 23:58:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:09,103 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-26 23:58:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:58:09,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:58:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:09,184 INFO L225 Difference]: With dead ends: 52071 [2019-12-26 23:58:09,184 INFO L226 Difference]: Without dead ends: 52071 [2019-12-26 23:58:09,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-26 23:58:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-26 23:58:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-26 23:58:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-26 23:58:10,199 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-26 23:58:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:10,200 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-26 23:58:10,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:58:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-26 23:58:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:10,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:10,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:10,239 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-26 23:58:10,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:10,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443105880] [2019-12-26 23:58:10,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:10,312 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-26 23:58:10,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443105880] [2019-12-26 23:58:10,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:10,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:58:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857339499] [2019-12-26 23:58:10,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:58:10,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:10,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:58:10,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:58:10,318 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-26 23:58:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:10,488 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-26 23:58:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:58:10,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 23:58:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:10,549 INFO L225 Difference]: With dead ends: 33507 [2019-12-26 23:58:10,549 INFO L226 Difference]: Without dead ends: 33507 [2019-12-26 23:58:10,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-26 23:58:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-26 23:58:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-26 23:58:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-26 23:58:11,070 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-26 23:58:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:11,070 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-26 23:58:11,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:58:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-26 23:58:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:11,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:11,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:11,106 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-26 23:58:11,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:11,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671462695] [2019-12-26 23:58:11,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:11,192 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-26 23:58:11,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671462695] [2019-12-26 23:58:11,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:11,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:58:11,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429718661] [2019-12-26 23:58:11,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:58:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:58:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:58:11,194 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-26 23:58:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:11,856 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-26 23:58:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:58:11,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:58:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:11,959 INFO L225 Difference]: With dead ends: 40500 [2019-12-26 23:58:11,959 INFO L226 Difference]: Without dead ends: 40276 [2019-12-26 23:58:11,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:58:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-26 23:58:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-26 23:58:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-26 23:58:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-26 23:58:12,921 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-26 23:58:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:12,922 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-26 23:58:12,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:58:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-26 23:58:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:12,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:12,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:12,984 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-26 23:58:12,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:12,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705520800] [2019-12-26 23:58:12,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:13,657 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-26 23:58:13,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705520800] [2019-12-26 23:58:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:13,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:58:13,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608394603] [2019-12-26 23:58:13,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:58:13,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:58:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:13,659 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 11 states. [2019-12-26 23:58:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:16,049 INFO L93 Difference]: Finished difference Result 56386 states and 169857 transitions. [2019-12-26 23:58:16,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:58:16,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 23:58:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:16,131 INFO L225 Difference]: With dead ends: 56386 [2019-12-26 23:58:16,131 INFO L226 Difference]: Without dead ends: 56283 [2019-12-26 23:58:16,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:58:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56283 states. [2019-12-26 23:58:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56283 to 41025. [2019-12-26 23:58:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41025 states. [2019-12-26 23:58:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41025 states to 41025 states and 124804 transitions. [2019-12-26 23:58:16,900 INFO L78 Accepts]: Start accepts. Automaton has 41025 states and 124804 transitions. Word has length 65 [2019-12-26 23:58:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:16,901 INFO L462 AbstractCegarLoop]: Abstraction has 41025 states and 124804 transitions. [2019-12-26 23:58:16,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:58:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 41025 states and 124804 transitions. [2019-12-26 23:58:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:16,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:16,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:16,951 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-26 23:58:16,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:16,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130883153] [2019-12-26 23:58:16,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:17,147 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-26 23:58:17,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130883153] [2019-12-26 23:58:17,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:17,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:58:17,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675641801] [2019-12-26 23:58:17,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:58:17,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:58:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:17,150 INFO L87 Difference]: Start difference. First operand 41025 states and 124804 transitions. Second operand 11 states. [2019-12-26 23:58:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:20,296 INFO L93 Difference]: Finished difference Result 62373 states and 187598 transitions. [2019-12-26 23:58:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:58:20,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 23:58:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:20,374 INFO L225 Difference]: With dead ends: 62373 [2019-12-26 23:58:20,374 INFO L226 Difference]: Without dead ends: 62065 [2019-12-26 23:58:20,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-26 23:58:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62065 states. [2019-12-26 23:58:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62065 to 41386. [2019-12-26 23:58:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-12-26 23:58:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 125486 transitions. [2019-12-26 23:58:21,140 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 125486 transitions. Word has length 65 [2019-12-26 23:58:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:21,140 INFO L462 AbstractCegarLoop]: Abstraction has 41386 states and 125486 transitions. [2019-12-26 23:58:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:58:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 125486 transitions. [2019-12-26 23:58:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:58:21,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:21,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:21,186 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-26 23:58:21,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:21,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301398929] [2019-12-26 23:58:21,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:21,252 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-26 23:58:21,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301398929] [2019-12-26 23:58:21,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:21,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:21,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012336510] [2019-12-26 23:58:21,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:21,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:21,254 INFO L87 Difference]: Start difference. First operand 41386 states and 125486 transitions. Second operand 3 states. [2019-12-26 23:58:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:21,404 INFO L93 Difference]: Finished difference Result 32806 states and 98471 transitions. [2019-12-26 23:58:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:21,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:58:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:21,466 INFO L225 Difference]: With dead ends: 32806 [2019-12-26 23:58:21,466 INFO L226 Difference]: Without dead ends: 32806 [2019-12-26 23:58:21,467 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-26 23:58:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32806 states. [2019-12-26 23:58:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32806 to 32057. [2019-12-26 23:58:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32057 states. [2019-12-26 23:58:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32057 states to 32057 states and 96097 transitions. [2019-12-26 23:58:21,958 INFO L78 Accepts]: Start accepts. Automaton has 32057 states and 96097 transitions. Word has length 65 [2019-12-26 23:58:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:21,958 INFO L462 AbstractCegarLoop]: Abstraction has 32057 states and 96097 transitions. [2019-12-26 23:58:21,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 32057 states and 96097 transitions. [2019-12-26 23:58:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:58:21,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:21,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:21,989 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 587293515, now seen corresponding path program 1 times [2019-12-26 23:58:21,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:21,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503673077] [2019-12-26 23:58:21,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:22,145 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-26 23:58:22,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503673077] [2019-12-26 23:58:22,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:22,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:58:22,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586086254] [2019-12-26 23:58:22,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:58:22,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:22,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:58:22,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:58:22,148 INFO L87 Difference]: Start difference. First operand 32057 states and 96097 transitions. Second operand 10 states. [2019-12-26 23:58:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:25,262 INFO L93 Difference]: Finished difference Result 51119 states and 150560 transitions. [2019-12-26 23:58:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 23:58:25,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:58:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:25,332 INFO L225 Difference]: With dead ends: 51119 [2019-12-26 23:58:25,333 INFO L226 Difference]: Without dead ends: 51119 [2019-12-26 23:58:25,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 23:58:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51119 states. [2019-12-26 23:58:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51119 to 29809. [2019-12-26 23:58:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29809 states. [2019-12-26 23:58:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29809 states to 29809 states and 89484 transitions. [2019-12-26 23:58:25,927 INFO L78 Accepts]: Start accepts. Automaton has 29809 states and 89484 transitions. Word has length 66 [2019-12-26 23:58:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:25,927 INFO L462 AbstractCegarLoop]: Abstraction has 29809 states and 89484 transitions. [2019-12-26 23:58:25,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:58:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29809 states and 89484 transitions. [2019-12-26 23:58:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:58:25,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:25,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:25,959 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -810539447, now seen corresponding path program 2 times [2019-12-26 23:58:25,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:25,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809884433] [2019-12-26 23:58:25,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:26,065 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-26 23:58:26,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809884433] [2019-12-26 23:58:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:58:26,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672796248] [2019-12-26 23:58:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:58:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:58:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:58:26,067 INFO L87 Difference]: Start difference. First operand 29809 states and 89484 transitions. Second operand 9 states. [2019-12-26 23:58:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:27,684 INFO L93 Difference]: Finished difference Result 52811 states and 157180 transitions. [2019-12-26 23:58:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:58:27,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 23:58:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:27,739 INFO L225 Difference]: With dead ends: 52811 [2019-12-26 23:58:27,740 INFO L226 Difference]: Without dead ends: 41264 [2019-12-26 23:58:27,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:58:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41264 states. [2019-12-26 23:58:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41264 to 30472. [2019-12-26 23:58:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30472 states. [2019-12-26 23:58:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30472 states to 30472 states and 90796 transitions. [2019-12-26 23:58:28,293 INFO L78 Accepts]: Start accepts. Automaton has 30472 states and 90796 transitions. Word has length 66 [2019-12-26 23:58:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:28,293 INFO L462 AbstractCegarLoop]: Abstraction has 30472 states and 90796 transitions. [2019-12-26 23:58:28,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:58:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30472 states and 90796 transitions. [2019-12-26 23:58:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:58:28,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:28,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:28,328 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1630345305, now seen corresponding path program 3 times [2019-12-26 23:58:28,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768724791] [2019-12-26 23:58:28,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:28,488 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-26 23:58:28,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768724791] [2019-12-26 23:58:28,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:28,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:58:28,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783669075] [2019-12-26 23:58:28,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:58:28,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:58:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:58:28,490 INFO L87 Difference]: Start difference. First operand 30472 states and 90796 transitions. Second operand 11 states. [2019-12-26 23:58:28,722 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-26 23:58:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:30,003 INFO L93 Difference]: Finished difference Result 64768 states and 192843 transitions. [2019-12-26 23:58:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:58:30,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 23:58:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:30,077 INFO L225 Difference]: With dead ends: 64768 [2019-12-26 23:58:30,077 INFO L226 Difference]: Without dead ends: 51054 [2019-12-26 23:58:30,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:58:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51054 states. [2019-12-26 23:58:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51054 to 29174. [2019-12-26 23:58:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29174 states. [2019-12-26 23:58:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29174 states to 29174 states and 86840 transitions. [2019-12-26 23:58:30,671 INFO L78 Accepts]: Start accepts. Automaton has 29174 states and 86840 transitions. Word has length 66 [2019-12-26 23:58:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:30,671 INFO L462 AbstractCegarLoop]: Abstraction has 29174 states and 86840 transitions. [2019-12-26 23:58:30,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:58:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29174 states and 86840 transitions. [2019-12-26 23:58:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:58:30,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:30,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:30,703 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1355417911, now seen corresponding path program 4 times [2019-12-26 23:58:30,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:30,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084290175] [2019-12-26 23:58:30,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:30,768 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-26 23:58:30,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084290175] [2019-12-26 23:58:30,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:30,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:58:30,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578464540] [2019-12-26 23:58:30,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:58:30,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:58:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:58:30,769 INFO L87 Difference]: Start difference. First operand 29174 states and 86840 transitions. Second operand 3 states. [2019-12-26 23:58:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:30,867 INFO L93 Difference]: Finished difference Result 29174 states and 86839 transitions. [2019-12-26 23:58:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:58:30,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:58:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:30,904 INFO L225 Difference]: With dead ends: 29174 [2019-12-26 23:58:30,904 INFO L226 Difference]: Without dead ends: 29174 [2019-12-26 23:58:30,905 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-26 23:58:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29174 states. [2019-12-26 23:58:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29174 to 21274. [2019-12-26 23:58:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21274 states. [2019-12-26 23:58:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21274 states to 21274 states and 64319 transitions. [2019-12-26 23:58:31,278 INFO L78 Accepts]: Start accepts. Automaton has 21274 states and 64319 transitions. Word has length 66 [2019-12-26 23:58:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:31,278 INFO L462 AbstractCegarLoop]: Abstraction has 21274 states and 64319 transitions. [2019-12-26 23:58:31,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:58:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 21274 states and 64319 transitions. [2019-12-26 23:58:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:58:31,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:31,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:31,302 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-26 23:58:31,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:31,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903990189] [2019-12-26 23:58:31,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:58:31,765 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-26 23:58:31,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903990189] [2019-12-26 23:58:31,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:58:31,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:58:31,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311319399] [2019-12-26 23:58:31,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:58:31,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:58:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:58:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:58:31,767 INFO L87 Difference]: Start difference. First operand 21274 states and 64319 transitions. Second operand 16 states. [2019-12-26 23:58:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:58:34,839 INFO L93 Difference]: Finished difference Result 26547 states and 79023 transitions. [2019-12-26 23:58:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:58:34,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 23:58:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:58:34,872 INFO L225 Difference]: With dead ends: 26547 [2019-12-26 23:58:34,873 INFO L226 Difference]: Without dead ends: 26088 [2019-12-26 23:58:34,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 23:58:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26088 states. [2019-12-26 23:58:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26088 to 21020. [2019-12-26 23:58:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21020 states. [2019-12-26 23:58:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21020 states to 21020 states and 63675 transitions. [2019-12-26 23:58:35,209 INFO L78 Accepts]: Start accepts. Automaton has 21020 states and 63675 transitions. Word has length 67 [2019-12-26 23:58:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:58:35,209 INFO L462 AbstractCegarLoop]: Abstraction has 21020 states and 63675 transitions. [2019-12-26 23:58:35,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:58:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21020 states and 63675 transitions. [2019-12-26 23:58:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:58:35,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:58:35,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:58:35,232 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:58:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:58:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-26 23:58:35,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:58:35,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183972131] [2019-12-26 23:58:35,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:58:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:58:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:58:35,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:58:35,333 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:58:35,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_26| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26|)) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26| 1)) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26|) |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_26|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 23:58:35,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-26 23:58:35,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In36651856| P0Thread1of1ForFork0_~arg.offset_Out36651856) (= |P0Thread1of1ForFork0_#in~arg.base_In36651856| P0Thread1of1ForFork0_~arg.base_Out36651856) (= (mod ~z$w_buff1_used~0_Out36651856 256) 0) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out36651856 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out36651856|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out36651856|) (= ~z$w_buff1~0_Out36651856 ~z$w_buff0~0_In36651856) (= ~z$w_buff0_used~0_Out36651856 1) (= ~z$w_buff1_used~0_Out36651856 ~z$w_buff0_used~0_In36651856) (= 1 ~z$w_buff0~0_Out36651856)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In36651856|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In36651856, ~z$w_buff0~0=~z$w_buff0~0_In36651856, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In36651856|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In36651856|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out36651856, ~z$w_buff0~0=~z$w_buff0~0_Out36651856, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out36651856, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out36651856, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In36651856|, ~z$w_buff1~0=~z$w_buff1~0_Out36651856, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out36651856, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out36651856|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out36651856} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:58:35,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-26 23:58:35,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1578503871| |P1Thread1of1ForFork1_#t~ite10_Out-1578503871|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1578503871 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1578503871 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1578503871| ~z~0_In-1578503871) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1578503871| ~z$w_buff1~0_In-1578503871)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1578503871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1578503871, ~z$w_buff1~0=~z$w_buff1~0_In-1578503871, ~z~0=~z~0_In-1578503871} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1578503871|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1578503871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1578503871, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1578503871|, ~z$w_buff1~0=~z$w_buff1~0_In-1578503871, ~z~0=~z~0_In-1578503871} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:58:35,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-922893665 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-922893665 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-922893665| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-922893665| ~z$w_buff0_used~0_In-922893665)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-922893665, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-922893665} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-922893665, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-922893665|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-922893665} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:58:35,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1375902394 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1375902394 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1375902394 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1375902394 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1375902394| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1375902394 |P1Thread1of1ForFork1_#t~ite12_Out-1375902394|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1375902394, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1375902394, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1375902394, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1375902394} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1375902394, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1375902394, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1375902394, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1375902394|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1375902394} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:58:35,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-947892100 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-947892100 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-947892100|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-947892100 |P1Thread1of1ForFork1_#t~ite13_Out-947892100|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-947892100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-947892100} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-947892100, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-947892100|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-947892100} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:58:35,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1903271686 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out1903271686| ~z$w_buff1~0_In1903271686) (= |P2Thread1of1ForFork2_#t~ite23_In1903271686| |P2Thread1of1ForFork2_#t~ite23_Out1903271686|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out1903271686| ~z$w_buff1~0_In1903271686) (= |P2Thread1of1ForFork2_#t~ite23_Out1903271686| |P2Thread1of1ForFork2_#t~ite24_Out1903271686|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1903271686 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1903271686 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In1903271686 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1903271686 256) 0)))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1903271686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1903271686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1903271686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903271686, ~z$w_buff1~0=~z$w_buff1~0_In1903271686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1903271686, ~weak$$choice2~0=~weak$$choice2~0_In1903271686} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1903271686|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1903271686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1903271686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1903271686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1903271686, ~z$w_buff1~0=~z$w_buff1~0_In1903271686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1903271686, ~weak$$choice2~0=~weak$$choice2~0_In1903271686} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 23:58:35,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1617437188 256)))) (or (and (= ~z$w_buff0_used~0_In1617437188 |P2Thread1of1ForFork2_#t~ite26_Out1617437188|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1617437188 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1617437188 256) 0)) (= (mod ~z$w_buff0_used~0_In1617437188 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1617437188 256))))) (= |P2Thread1of1ForFork2_#t~ite26_Out1617437188| |P2Thread1of1ForFork2_#t~ite27_Out1617437188|)) (and (= ~z$w_buff0_used~0_In1617437188 |P2Thread1of1ForFork2_#t~ite27_Out1617437188|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In1617437188| |P2Thread1of1ForFork2_#t~ite26_Out1617437188|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1617437188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617437188, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1617437188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617437188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1617437188, ~weak$$choice2~0=~weak$$choice2~0_In1617437188} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1617437188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617437188, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1617437188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617437188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1617437188, ~weak$$choice2~0=~weak$$choice2~0_In1617437188, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1617437188|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-26 23:58:35,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In332276 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In332276 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In332276 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In332276 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out332276| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out332276| ~z$r_buff1_thd2~0_In332276) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In332276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In332276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In332276} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In332276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In332276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332276, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out332276|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In332276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:58:35,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:58:35,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-418557253 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-418557253| |P2Thread1of1ForFork2_#t~ite29_Out-418557253|) (= ~z$w_buff1_used~0_In-418557253 |P2Thread1of1ForFork2_#t~ite30_Out-418557253|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-418557253 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-418557253 256))) (= (mod ~z$w_buff0_used~0_In-418557253 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-418557253 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out-418557253| |P2Thread1of1ForFork2_#t~ite29_Out-418557253|) (= ~z$w_buff1_used~0_In-418557253 |P2Thread1of1ForFork2_#t~ite29_Out-418557253|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-418557253, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-418557253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-418557253, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-418557253, ~weak$$choice2~0=~weak$$choice2~0_In-418557253, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-418557253|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-418557253|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-418557253, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-418557253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-418557253, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-418557253, ~weak$$choice2~0=~weak$$choice2~0_In-418557253, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-418557253|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 23:58:35,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 23:58:35,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:58:35,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1770119038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1770119038 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1770119038| ~z$w_buff0_used~0_In-1770119038) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1770119038| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770119038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1770119038} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1770119038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770119038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1770119038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:58:35,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-877575267 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-877575267 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-877575267 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-877575267 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-877575267|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-877575267 |P0Thread1of1ForFork0_#t~ite6_Out-877575267|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-877575267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-877575267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-877575267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-877575267} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-877575267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-877575267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-877575267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-877575267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-877575267} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:58:35,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In123595297 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In123595297 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In123595297 ~z$r_buff0_thd1~0_Out123595297)) (and (= ~z$r_buff0_thd1~0_Out123595297 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In123595297, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In123595297} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In123595297, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out123595297|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out123595297} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:58:35,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1964700572 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1964700572 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1964700572 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1964700572 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1964700572| ~z$r_buff1_thd1~0_In1964700572)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1964700572| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964700572, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1964700572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964700572, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1964700572} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1964700572, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1964700572|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1964700572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964700572, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1964700572} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:58:35,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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-26 23:58:35,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out172424866| |P2Thread1of1ForFork2_#t~ite38_Out172424866|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In172424866 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In172424866 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out172424866| ~z~0_In172424866)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out172424866| ~z$w_buff1~0_In172424866) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In172424866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172424866, ~z$w_buff1~0=~z$w_buff1~0_In172424866, ~z~0=~z~0_In172424866} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In172424866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172424866, ~z$w_buff1~0=~z$w_buff1~0_In172424866, ~z~0=~z~0_In172424866, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out172424866|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out172424866|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-26 23:58:35,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-379288834 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-379288834 256) 0))) (or (and (= ~z$w_buff0_used~0_In-379288834 |P2Thread1of1ForFork2_#t~ite40_Out-379288834|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-379288834|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-379288834, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-379288834} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-379288834, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-379288834, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-379288834|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-26 23:58:35,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-860541348 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-860541348 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-860541348 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-860541348 256) 0))) (or (and (= ~z$w_buff1_used~0_In-860541348 |P2Thread1of1ForFork2_#t~ite41_Out-860541348|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-860541348|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-860541348, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-860541348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860541348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-860541348} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-860541348|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860541348, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-860541348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860541348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-860541348} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-26 23:58:35,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In83493360 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In83493360 256)))) (or (and (= ~z$r_buff0_thd3~0_In83493360 |P2Thread1of1ForFork2_#t~ite42_Out83493360|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out83493360| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In83493360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In83493360} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out83493360|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In83493360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In83493360} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-26 23:58:35,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-326096568 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-326096568 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-326096568 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-326096568 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-326096568|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-326096568 |P2Thread1of1ForFork2_#t~ite43_Out-326096568|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-326096568, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-326096568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-326096568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-326096568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-326096568, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-326096568, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-326096568|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-326096568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-326096568} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-26 23:58:35,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:58:35,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:58:35,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1924971860| |ULTIMATE.start_main_#t~ite47_Out-1924971860|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1924971860 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1924971860 256)))) (or (and (= ~z$w_buff1~0_In-1924971860 |ULTIMATE.start_main_#t~ite47_Out-1924971860|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In-1924971860 |ULTIMATE.start_main_#t~ite47_Out-1924971860|) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1924971860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1924971860, ~z$w_buff1~0=~z$w_buff1~0_In-1924971860, ~z~0=~z~0_In-1924971860} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1924971860, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1924971860|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1924971860, ~z$w_buff1~0=~z$w_buff1~0_In-1924971860, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1924971860|, ~z~0=~z~0_In-1924971860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:58:35,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In524551818 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In524551818 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out524551818| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out524551818| ~z$w_buff0_used~0_In524551818)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In524551818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524551818} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In524551818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524551818, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out524551818|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 23:58:35,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1707501455 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1707501455 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1707501455 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1707501455 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-1707501455| ~z$w_buff1_used~0_In-1707501455) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1707501455| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1707501455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1707501455, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1707501455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1707501455} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1707501455|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1707501455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1707501455, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1707501455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1707501455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 23:58:35,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1574972262 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1574972262 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1574972262| ~z$r_buff0_thd0~0_In-1574972262) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1574972262| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1574972262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1574972262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1574972262, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1574972262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1574972262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:58:35,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In115310238 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In115310238 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In115310238 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In115310238 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out115310238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In115310238 |ULTIMATE.start_main_#t~ite52_Out115310238|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In115310238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In115310238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In115310238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115310238} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out115310238|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In115310238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In115310238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In115310238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115310238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 23:58:35,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:58:35,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:58:35 BasicIcfg [2019-12-26 23:58:35,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:58:35,457 INFO L168 Benchmark]: Toolchain (without parser) took 109290.49 ms. Allocated memory was 138.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,467 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.46 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 155.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.97 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,468 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,469 INFO L168 Benchmark]: RCFGBuilder took 870.22 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,469 INFO L168 Benchmark]: TraceAbstraction took 107506.98 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:58:35,475 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.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.46 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 155.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.97 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.22 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107506.98 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L744] 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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L824] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 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) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 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 [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.1s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7106 SDtfs, 8457 SDslu, 23504 SDs, 0 SdLazy, 16900 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 71 SyntacticMatches, 27 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 334957 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1677 NumberOfCodeBlocks, 1677 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1578 ConstructedInterpolants, 0 QuantifiedInterpolants, 322343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...