/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/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:50:51,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:50:51,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:50:51,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:50:51,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:50:51,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:50:51,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:50:51,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:50:51,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:50:51,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:50:51,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:50:51,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:50:51,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:50:51,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:50:51,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:50:51,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:50:51,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:50:51,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:50:51,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:50:51,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:50:51,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:50:51,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:50:51,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:50:51,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:50:51,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:50:51,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:50:51,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:50:51,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:50:51,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:50:51,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:50:51,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:50:51,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:50:51,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:50:51,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:50:51,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:50:51,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:50:51,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:50:51,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:50:51,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:50:51,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:50:51,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:50:51,859 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:50:51,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:50:51,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:50:51,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:50:51,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:50:51,876 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:50:51,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:50:51,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:50:51,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:50:51,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:50:51,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:50:51,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:50:51,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:50:51,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:50:51,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:50:51,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:50:51,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:50:51,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:50:51,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:50:51,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:50:51,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:50:51,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:50:51,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:50:51,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:50:51,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:50:51,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:50:51,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:50:51,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:50:51,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:50:51,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:50:51,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:50:52,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:50:52,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:50:52,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:50:52,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:50:52,177 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:50:52,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-26 23:50:52,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c56a95036/39b7620324f94cb2a91fd4c93b1f8ef3/FLAGb58d8cf42 [2019-12-26 23:50:52,831 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:50:52,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-26 23:50:52,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c56a95036/39b7620324f94cb2a91fd4c93b1f8ef3/FLAGb58d8cf42 [2019-12-26 23:50:53,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c56a95036/39b7620324f94cb2a91fd4c93b1f8ef3 [2019-12-26 23:50:53,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:50:53,111 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:50:53,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:50:53,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:50:53,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:50:53,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426cc07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53, skipping insertion in model container [2019-12-26 23:50:53,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:50:53,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:50:53,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:50:53,696 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:50:53,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:50:53,873 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:50:53,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53 WrapperNode [2019-12-26 23:50:53,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:50:53,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:50:53,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:50:53,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:50:53,884 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:50:53" (1/1) ... [2019-12-26 23:50:53,906 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:50:53" (1/1) ... [2019-12-26 23:50:53,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:50:53,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:50:53,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:50:53,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:50:53,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (1/1) ... [2019-12-26 23:50:53,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:50:53,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:50:53,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:50:53,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:50:53,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (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:50:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:50:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:50:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:50:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:50:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:50:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:50:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:50:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:50:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:50:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:50:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:50:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:50:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:50:54,056 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:50:54,834 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:50:54,834 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:50:54,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:50:54 BoogieIcfgContainer [2019-12-26 23:50:54,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:50:54,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:50:54,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:50:54,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:50:54,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:50:53" (1/3) ... [2019-12-26 23:50:54,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33de1d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:50:54, skipping insertion in model container [2019-12-26 23:50:54,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:50:53" (2/3) ... [2019-12-26 23:50:54,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33de1d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:50:54, skipping insertion in model container [2019-12-26 23:50:54,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:50:54" (3/3) ... [2019-12-26 23:50:54,848 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2019-12-26 23:50:54,856 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:50:54,857 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:50:54,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:50:54,867 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:50:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:54,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:50:55,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:50:55,032 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:50:55,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:50:55,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:50:55,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:50:55,033 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:50:55,033 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:50:55,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:50:55,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:50:55,059 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-26 23:50:55,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:50:55,191 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:50:55,191 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:50:55,207 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:50:55,231 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:50:55,285 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:50:55,286 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:50:55,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:50:55,315 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:50:55,317 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:51:00,463 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:51:00,579 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:51:00,607 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-26 23:51:00,608 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 23:51:00,611 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-26 23:51:16,841 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-26 23:51:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-26 23:51:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:51:16,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:16,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:51:16,849 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:51:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-26 23:51:16,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:16,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072074106] [2019-12-26 23:51:16,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:17,325 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:51:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072074106] [2019-12-26 23:51:17,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:17,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:51:17,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642992088] [2019-12-26 23:51:17,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:51:17,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:51:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:17,354 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-26 23:51:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:18,531 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-26 23:51:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:51:18,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:51:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:22,389 INFO L225 Difference]: With dead ends: 112536 [2019-12-26 23:51:22,390 INFO L226 Difference]: Without dead ends: 110184 [2019-12-26 23:51:22,392 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:51:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-26 23:51:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-26 23:51:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-26 23:51:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-26 23:51:29,364 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-26 23:51:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:29,365 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-26 23:51:29,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:51:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-26 23:51:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:51:29,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:29,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:29,370 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:51:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-26 23:51:29,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:29,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167768690] [2019-12-26 23:51:29,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:29,513 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:51:29,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167768690] [2019-12-26 23:51:29,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:29,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:51:29,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215715365] [2019-12-26 23:51:29,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:51:29,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:51:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:51:29,517 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-26 23:51:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:34,741 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-26 23:51:34,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:51:34,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:51:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:35,334 INFO L225 Difference]: With dead ends: 172298 [2019-12-26 23:51:35,335 INFO L226 Difference]: Without dead ends: 172249 [2019-12-26 23:51:35,335 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:51:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-26 23:51:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-26 23:51:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-26 23:51:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-26 23:51:51,106 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-26 23:51:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:51,107 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-26 23:51:51,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:51:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-26 23:51:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:51:51,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:51,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:51,115 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:51:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-26 23:51:51,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:51,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573990315] [2019-12-26 23:51:51,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:51,175 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:51:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573990315] [2019-12-26 23:51:51,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:51:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389982073] [2019-12-26 23:51:51,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:51:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:51:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:51,177 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-26 23:51:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:51,296 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-26 23:51:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:51:51,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:51:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:51,381 INFO L225 Difference]: With dead ends: 32129 [2019-12-26 23:51:51,382 INFO L226 Difference]: Without dead ends: 32129 [2019-12-26 23:51:51,382 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:51:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-26 23:51:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-26 23:51:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-26 23:51:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-26 23:51:52,008 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-26 23:51:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:52,008 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-26 23:51:52,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:51:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-26 23:51:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:51:52,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:52,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:52,011 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:51:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-26 23:51:52,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:52,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227473625] [2019-12-26 23:51:52,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:52,081 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:51:52,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227473625] [2019-12-26 23:51:52,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:52,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:51:52,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828437536] [2019-12-26 23:51:52,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:51:52,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:52,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:51:52,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:51:52,083 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-26 23:51:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:52,501 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-26 23:51:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:51:52,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:51:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:52,597 INFO L225 Difference]: With dead ends: 43159 [2019-12-26 23:51:52,597 INFO L226 Difference]: Without dead ends: 43152 [2019-12-26 23:51:52,597 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:51:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-26 23:51:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-26 23:51:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-26 23:51:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-26 23:51:54,749 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-26 23:51:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:54,749 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-26 23:51:54,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:51:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-26 23:51:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:51:54,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:54,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:54,755 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:51:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-26 23:51:54,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:54,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147080218] [2019-12-26 23:51:54,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:54,847 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:51:54,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147080218] [2019-12-26 23:51:54,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:54,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:51:54,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427923139] [2019-12-26 23:51:54,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:51:54,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:51:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:51:54,849 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-26 23:51:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:55,560 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-26 23:51:55,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:51:55,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:51:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:55,654 INFO L225 Difference]: With dead ends: 50788 [2019-12-26 23:51:55,654 INFO L226 Difference]: Without dead ends: 50775 [2019-12-26 23:51:55,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:51:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-26 23:51:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-26 23:51:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-26 23:51:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-26 23:51:59,150 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-26 23:51:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:59,150 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-26 23:51:59,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:51:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-26 23:51:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:51:59,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:59,164 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:51:59,164 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:51:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-26 23:51:59,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:59,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460559238] [2019-12-26 23:51:59,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:59,225 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:51:59,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460559238] [2019-12-26 23:51:59,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:59,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:51:59,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200163028] [2019-12-26 23:51:59,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:51:59,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:51:59,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:51:59,227 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-26 23:51:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:59,268 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-26 23:51:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:51:59,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:51:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:59,280 INFO L225 Difference]: With dead ends: 7382 [2019-12-26 23:51:59,280 INFO L226 Difference]: Without dead ends: 7382 [2019-12-26 23:51:59,280 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:51:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-26 23:51:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-26 23:51:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-26 23:51:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-26 23:51:59,391 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-26 23:51:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:59,391 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-26 23:51:59,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:51:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-26 23:51:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:51:59,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:59,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:59,403 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:51:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-26 23:51:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980304734] [2019-12-26 23:51:59,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:59,490 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:51:59,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980304734] [2019-12-26 23:51:59,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:59,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:51:59,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151127610] [2019-12-26 23:51:59,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:51:59,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:51:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:51:59,492 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-26 23:51:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:59,532 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-26 23:51:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:51:59,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:51:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:59,542 INFO L225 Difference]: With dead ends: 5311 [2019-12-26 23:51:59,542 INFO L226 Difference]: Without dead ends: 5311 [2019-12-26 23:51:59,543 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:51:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-26 23:51:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-26 23:51:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-26 23:51:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-26 23:51:59,624 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-26 23:51:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:59,624 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-26 23:51:59,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:51:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-26 23:51:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:51:59,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:59,632 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:51:59,632 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:51:59,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-26 23:51:59,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:59,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729254877] [2019-12-26 23:51:59,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:59,725 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:51:59,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729254877] [2019-12-26 23:51:59,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:59,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:51:59,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243334349] [2019-12-26 23:51:59,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:51:59,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:51:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:59,727 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-26 23:51:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:59,783 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-26 23:51:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:51:59,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:51:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:59,791 INFO L225 Difference]: With dead ends: 4958 [2019-12-26 23:51:59,792 INFO L226 Difference]: Without dead ends: 4958 [2019-12-26 23:51:59,792 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:51:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-26 23:51:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-26 23:51:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-26 23:51:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-26 23:51:59,859 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-26 23:51:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:59,860 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-26 23:51:59,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:51:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-26 23:51:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:51:59,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:59,868 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:51:59,868 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:51:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-26 23:51:59,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:59,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818733201] [2019-12-26 23:51:59,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:00,008 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:52:00,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818733201] [2019-12-26 23:52:00,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:00,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:52:00,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126895856] [2019-12-26 23:52:00,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:00,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:00,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:00,014 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 5 states. [2019-12-26 23:52:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:00,338 INFO L93 Difference]: Finished difference Result 7545 states and 21557 transitions. [2019-12-26 23:52:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:52:00,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:52:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:00,349 INFO L225 Difference]: With dead ends: 7545 [2019-12-26 23:52:00,350 INFO L226 Difference]: Without dead ends: 7545 [2019-12-26 23:52:00,350 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:52:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2019-12-26 23:52:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 6351. [2019-12-26 23:52:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6351 states. [2019-12-26 23:52:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 18327 transitions. [2019-12-26 23:52:00,446 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 18327 transitions. Word has length 65 [2019-12-26 23:52:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 6351 states and 18327 transitions. [2019-12-26 23:52:00,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 18327 transitions. [2019-12-26 23:52:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:00,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:00,457 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:52:00,457 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:52:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1320159464, now seen corresponding path program 2 times [2019-12-26 23:52:00,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:00,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87191792] [2019-12-26 23:52:00,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:00,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87191792] [2019-12-26 23:52:00,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:00,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:00,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238311215] [2019-12-26 23:52:00,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:00,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:00,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:00,568 INFO L87 Difference]: Start difference. First operand 6351 states and 18327 transitions. Second operand 6 states. [2019-12-26 23:52:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:01,016 INFO L93 Difference]: Finished difference Result 10885 states and 31206 transitions. [2019-12-26 23:52:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:52:01,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:52:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:01,030 INFO L225 Difference]: With dead ends: 10885 [2019-12-26 23:52:01,031 INFO L226 Difference]: Without dead ends: 10885 [2019-12-26 23:52:01,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:52:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-12-26 23:52:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 7013. [2019-12-26 23:52:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7013 states. [2019-12-26 23:52:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 20305 transitions. [2019-12-26 23:52:01,153 INFO L78 Accepts]: Start accepts. Automaton has 7013 states and 20305 transitions. Word has length 65 [2019-12-26 23:52:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:01,153 INFO L462 AbstractCegarLoop]: Abstraction has 7013 states and 20305 transitions. [2019-12-26 23:52:01,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7013 states and 20305 transitions. [2019-12-26 23:52:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:01,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:01,163 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:52:01,163 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:52:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:01,163 INFO L82 PathProgramCache]: Analyzing trace with hash -518212600, now seen corresponding path program 3 times [2019-12-26 23:52:01,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:01,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217305998] [2019-12-26 23:52:01,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:01,309 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:52:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217305998] [2019-12-26 23:52:01,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:01,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:52:01,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65145888] [2019-12-26 23:52:01,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:52:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:52:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:52:01,311 INFO L87 Difference]: Start difference. First operand 7013 states and 20305 transitions. Second operand 7 states. [2019-12-26 23:52:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:02,115 INFO L93 Difference]: Finished difference Result 10692 states and 30648 transitions. [2019-12-26 23:52:02,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:52:02,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:52:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:02,129 INFO L225 Difference]: With dead ends: 10692 [2019-12-26 23:52:02,129 INFO L226 Difference]: Without dead ends: 10692 [2019-12-26 23:52:02,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:52:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2019-12-26 23:52:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 6617. [2019-12-26 23:52:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2019-12-26 23:52:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 19142 transitions. [2019-12-26 23:52:02,248 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 19142 transitions. Word has length 65 [2019-12-26 23:52:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:02,248 INFO L462 AbstractCegarLoop]: Abstraction has 6617 states and 19142 transitions. [2019-12-26 23:52:02,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:52:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 19142 transitions. [2019-12-26 23:52:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:02,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:02,257 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:52:02,258 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:52:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash -61468540, now seen corresponding path program 4 times [2019-12-26 23:52:02,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:02,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004711618] [2019-12-26 23:52:02,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:02,361 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:52:02,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004711618] [2019-12-26 23:52:02,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:02,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:02,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992553983] [2019-12-26 23:52:02,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:02,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:02,363 INFO L87 Difference]: Start difference. First operand 6617 states and 19142 transitions. Second operand 6 states. [2019-12-26 23:52:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:03,020 INFO L93 Difference]: Finished difference Result 9281 states and 26360 transitions. [2019-12-26 23:52:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:52:03,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:52:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:03,034 INFO L225 Difference]: With dead ends: 9281 [2019-12-26 23:52:03,034 INFO L226 Difference]: Without dead ends: 9281 [2019-12-26 23:52:03,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:52:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-12-26 23:52:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 6874. [2019-12-26 23:52:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-12-26 23:52:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 19886 transitions. [2019-12-26 23:52:03,153 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 19886 transitions. Word has length 65 [2019-12-26 23:52:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:03,154 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 19886 transitions. [2019-12-26 23:52:03,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 19886 transitions. [2019-12-26 23:52:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:03,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:03,164 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:52:03,165 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:52:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash 49095600, now seen corresponding path program 5 times [2019-12-26 23:52:03,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:03,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486886614] [2019-12-26 23:52:03,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:03,265 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:52:03,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486886614] [2019-12-26 23:52:03,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:03,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:03,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110286398] [2019-12-26 23:52:03,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:03,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:03,268 INFO L87 Difference]: Start difference. First operand 6874 states and 19886 transitions. Second operand 6 states. [2019-12-26 23:52:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:03,798 INFO L93 Difference]: Finished difference Result 11084 states and 31825 transitions. [2019-12-26 23:52:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:52:03,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:52:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:03,813 INFO L225 Difference]: With dead ends: 11084 [2019-12-26 23:52:03,813 INFO L226 Difference]: Without dead ends: 11084 [2019-12-26 23:52:03,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:52:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2019-12-26 23:52:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 7342. [2019-12-26 23:52:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2019-12-26 23:52:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 21312 transitions. [2019-12-26 23:52:03,944 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 21312 transitions. Word has length 65 [2019-12-26 23:52:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:03,944 INFO L462 AbstractCegarLoop]: Abstraction has 7342 states and 21312 transitions. [2019-12-26 23:52:03,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 21312 transitions. [2019-12-26 23:52:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:03,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:03,954 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:52:03,954 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:52:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1715239754, now seen corresponding path program 6 times [2019-12-26 23:52:03,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:03,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804061590] [2019-12-26 23:52:03,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:04,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:52:04,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804061590] [2019-12-26 23:52:04,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:04,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:52:04,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753725644] [2019-12-26 23:52:04,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:52:04,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:52:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:52:04,067 INFO L87 Difference]: Start difference. First operand 7342 states and 21312 transitions. Second operand 8 states. [2019-12-26 23:52:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:04,967 INFO L93 Difference]: Finished difference Result 12664 states and 36288 transitions. [2019-12-26 23:52:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:52:04,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 23:52:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:04,985 INFO L225 Difference]: With dead ends: 12664 [2019-12-26 23:52:04,986 INFO L226 Difference]: Without dead ends: 12664 [2019-12-26 23:52:04,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:52:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12664 states. [2019-12-26 23:52:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12664 to 7366. [2019-12-26 23:52:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7366 states. [2019-12-26 23:52:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7366 states to 7366 states and 21370 transitions. [2019-12-26 23:52:05,127 INFO L78 Accepts]: Start accepts. Automaton has 7366 states and 21370 transitions. Word has length 65 [2019-12-26 23:52:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:05,127 INFO L462 AbstractCegarLoop]: Abstraction has 7366 states and 21370 transitions. [2019-12-26 23:52:05,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:52:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7366 states and 21370 transitions. [2019-12-26 23:52:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:05,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:05,138 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:52:05,138 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:52:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2133950940, now seen corresponding path program 7 times [2019-12-26 23:52:05,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:05,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726898475] [2019-12-26 23:52:05,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:05,241 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:52:05,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726898475] [2019-12-26 23:52:05,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:05,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:05,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826164589] [2019-12-26 23:52:05,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:05,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:05,243 INFO L87 Difference]: Start difference. First operand 7366 states and 21370 transitions. Second operand 6 states. [2019-12-26 23:52:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:05,825 INFO L93 Difference]: Finished difference Result 11343 states and 32283 transitions. [2019-12-26 23:52:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:52:05,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:52:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:05,845 INFO L225 Difference]: With dead ends: 11343 [2019-12-26 23:52:05,845 INFO L226 Difference]: Without dead ends: 11343 [2019-12-26 23:52:05,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:52:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11343 states. [2019-12-26 23:52:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11343 to 8250. [2019-12-26 23:52:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8250 states. [2019-12-26 23:52:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8250 states to 8250 states and 23904 transitions. [2019-12-26 23:52:06,006 INFO L78 Accepts]: Start accepts. Automaton has 8250 states and 23904 transitions. Word has length 65 [2019-12-26 23:52:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:06,006 INFO L462 AbstractCegarLoop]: Abstraction has 8250 states and 23904 transitions. [2019-12-26 23:52:06,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8250 states and 23904 transitions. [2019-12-26 23:52:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:06,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:06,015 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:52:06,015 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:52:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1019599714, now seen corresponding path program 8 times [2019-12-26 23:52:06,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:06,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251097280] [2019-12-26 23:52:06,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:06,076 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:52:06,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251097280] [2019-12-26 23:52:06,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:06,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:06,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771412809] [2019-12-26 23:52:06,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:06,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:06,078 INFO L87 Difference]: Start difference. First operand 8250 states and 23904 transitions. Second operand 3 states. [2019-12-26 23:52:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:06,139 INFO L93 Difference]: Finished difference Result 8250 states and 23903 transitions. [2019-12-26 23:52:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:06,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:52:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:06,153 INFO L225 Difference]: With dead ends: 8250 [2019-12-26 23:52:06,153 INFO L226 Difference]: Without dead ends: 8250 [2019-12-26 23:52:06,153 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:52:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2019-12-26 23:52:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 4891. [2019-12-26 23:52:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2019-12-26 23:52:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 14484 transitions. [2019-12-26 23:52:06,270 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 14484 transitions. Word has length 65 [2019-12-26 23:52:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:06,270 INFO L462 AbstractCegarLoop]: Abstraction has 4891 states and 14484 transitions. [2019-12-26 23:52:06,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 14484 transitions. [2019-12-26 23:52:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:06,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:06,275 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:52:06,275 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:52:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash -655270585, now seen corresponding path program 1 times [2019-12-26 23:52:06,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:06,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550646558] [2019-12-26 23:52:06,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:06,338 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:52:06,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550646558] [2019-12-26 23:52:06,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:06,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:06,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285348865] [2019-12-26 23:52:06,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:06,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:06,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:06,341 INFO L87 Difference]: Start difference. First operand 4891 states and 14484 transitions. Second operand 3 states. [2019-12-26 23:52:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:06,363 INFO L93 Difference]: Finished difference Result 4519 states and 13079 transitions. [2019-12-26 23:52:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:06,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:52:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:06,371 INFO L225 Difference]: With dead ends: 4519 [2019-12-26 23:52:06,371 INFO L226 Difference]: Without dead ends: 4519 [2019-12-26 23:52:06,371 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:52:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-12-26 23:52:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3627. [2019-12-26 23:52:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3627 states. [2019-12-26 23:52:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 10539 transitions. [2019-12-26 23:52:06,522 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 10539 transitions. Word has length 66 [2019-12-26 23:52:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:06,522 INFO L462 AbstractCegarLoop]: Abstraction has 3627 states and 10539 transitions. [2019-12-26 23:52:06,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 10539 transitions. [2019-12-26 23:52:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:52:06,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:06,526 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:52:06,526 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:52:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1474263877, now seen corresponding path program 1 times [2019-12-26 23:52:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:06,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428542026] [2019-12-26 23:52:06,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:06,578 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:52:06,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428542026] [2019-12-26 23:52:06,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:06,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:06,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680378661] [2019-12-26 23:52:06,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:06,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:06,580 INFO L87 Difference]: Start difference. First operand 3627 states and 10539 transitions. Second operand 3 states. [2019-12-26 23:52:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:06,605 INFO L93 Difference]: Finished difference Result 3385 states and 9567 transitions. [2019-12-26 23:52:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:06,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:52:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:06,611 INFO L225 Difference]: With dead ends: 3385 [2019-12-26 23:52:06,611 INFO L226 Difference]: Without dead ends: 3385 [2019-12-26 23:52:06,612 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:52:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-12-26 23:52:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2989. [2019-12-26 23:52:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-26 23:52:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-26 23:52:06,676 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-26 23:52:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:06,676 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-26 23:52:06,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-26 23:52:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:06,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:06,680 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, 1] [2019-12-26 23:52:06,681 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:52:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-26 23:52:06,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:06,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809757775] [2019-12-26 23:52:06,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:06,851 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:52:06,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809757775] [2019-12-26 23:52:06,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:06,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:52:06,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522721831] [2019-12-26 23:52:06,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:52:06,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:52:06,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:52:06,853 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 12 states. [2019-12-26 23:52:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:07,232 INFO L93 Difference]: Finished difference Result 5256 states and 14786 transitions. [2019-12-26 23:52:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:52:07,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-26 23:52:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:07,240 INFO L225 Difference]: With dead ends: 5256 [2019-12-26 23:52:07,240 INFO L226 Difference]: Without dead ends: 5224 [2019-12-26 23:52:07,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:52:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2019-12-26 23:52:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 4144. [2019-12-26 23:52:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-26 23:52:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-26 23:52:07,304 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-26 23:52:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:07,304 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-26 23:52:07,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:52:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-26 23:52:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:07,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:07,309 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, 1] [2019-12-26 23:52:07,309 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:52:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-26 23:52:07,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:07,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458203192] [2019-12-26 23:52:07,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:07,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:52:07,421 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:52:07,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27|) |v_ULTIMATE.start_main_~#t2183~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff0_thd3~0_110) (= (store .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27| 1) |v_#valid_63|) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 |v_ULTIMATE.start_main_~#t2183~0.offset_20|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2183~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27|)) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2183~0.base_27|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_16|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_~#t2183~0.offset=|v_ULTIMATE.start_main_~#t2183~0.offset_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ULTIMATE.start_main_~#t2183~0.base=|v_ULTIMATE.start_main_~#t2183~0.base_27|, ~y~0=v_~y~0_170, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2183~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2183~0.base, ~y~0, ULTIMATE.start_main_~#t2184~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2184~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:07,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:07,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2184~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11|) |v_ULTIMATE.start_main_~#t2184~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2184~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2184~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2184~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2184~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2184~0.offset] because there is no mapped edge [2019-12-26 23:52:07,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2185~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13|) |v_ULTIMATE.start_main_~#t2185~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2185~0.offset_11|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2185~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2185~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_11|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:52:07,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2135561775 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2135561775 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2135561775| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2135561775| ~y$w_buff0_used~0_In2135561775) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135561775, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135561775} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2135561775|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135561775, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135561775} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:52:07,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1921220496 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1921220496 256) 0))) (or (and (= ~y$w_buff1~0_In1921220496 |P1Thread1of1ForFork1_#t~ite9_Out1921220496|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1921220496 |P1Thread1of1ForFork1_#t~ite9_Out1921220496|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1921220496, ~y$w_buff1~0=~y$w_buff1~0_In1921220496, ~y~0=~y~0_In1921220496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1921220496} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1921220496, ~y$w_buff1~0=~y$w_buff1~0_In1921220496, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1921220496|, ~y~0=~y~0_In1921220496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1921220496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:52:07,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2091121451 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-2091121451 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2091121451 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2091121451 256) 0))) (or (and (= ~y$w_buff1_used~0_In-2091121451 |P0Thread1of1ForFork0_#t~ite6_Out-2091121451|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2091121451|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2091121451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091121451, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2091121451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2091121451} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2091121451|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2091121451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091121451, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2091121451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2091121451} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:52:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1865268373 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1865268373 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1865268373) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-1865268373 ~y$r_buff0_thd1~0_Out-1865268373)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865268373, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1865268373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865268373, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1865268373|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1865268373} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:52:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1995631953 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1995631953 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1995631953 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1995631953 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1995631953| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1995631953| ~y$r_buff1_thd1~0_In1995631953) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1995631953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995631953, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1995631953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995631953} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1995631953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995631953, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1995631953|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1995631953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995631953} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:52:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:52:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In923399555 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In923399555 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In923399555 |P2Thread1of1ForFork2_#t~ite15_Out923399555|) (not .cse1)) (and (= ~y~0_In923399555 |P2Thread1of1ForFork2_#t~ite15_Out923399555|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923399555, ~y$w_buff1~0=~y$w_buff1~0_In923399555, ~y~0=~y~0_In923399555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923399555} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923399555, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out923399555|, ~y$w_buff1~0=~y$w_buff1~0_In923399555, ~y~0=~y~0_In923399555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923399555} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:52:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:52:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-26 23:52:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2080457203 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2080457203 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out2080457203|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In2080457203 |P1Thread1of1ForFork1_#t~ite11_Out2080457203|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2080457203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2080457203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2080457203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2080457203, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2080457203|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:52:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In327354122 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In327354122 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In327354122 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In327354122 256)))) (or (and (= ~y$w_buff1_used~0_In327354122 |P1Thread1of1ForFork1_#t~ite12_Out327354122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out327354122|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In327354122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In327354122, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In327354122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In327354122} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In327354122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In327354122, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In327354122, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out327354122|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In327354122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:52:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1127275995 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1127275995 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1127275995| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1127275995| ~y$r_buff0_thd2~0_In-1127275995)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1127275995, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1127275995} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1127275995, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1127275995, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1127275995|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:52:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In300049600 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In300049600 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In300049600 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In300049600 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out300049600|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In300049600 |P1Thread1of1ForFork1_#t~ite14_Out300049600|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300049600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300049600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300049600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300049600} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300049600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300049600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300049600, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out300049600|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300049600} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:52:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In865838276 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In865838276 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out865838276|) (not .cse1)) (and (= ~y$w_buff0_used~0_In865838276 |P2Thread1of1ForFork2_#t~ite17_Out865838276|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In865838276, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865838276} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In865838276, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865838276, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out865838276|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:52:07,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1776394003 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1776394003 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1776394003 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1776394003 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1776394003| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite18_Out1776394003| ~y$w_buff1_used~0_In1776394003)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1776394003, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1776394003, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1776394003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1776394003} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1776394003, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1776394003, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1776394003, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1776394003|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1776394003} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:52:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:52:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1287124218 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1287124218 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1287124218| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1287124218| ~y$r_buff0_thd3~0_In1287124218) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1287124218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1287124218} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1287124218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1287124218, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1287124218|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:52:07,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2114414610 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-2114414610 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2114414610 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2114414610 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-2114414610| ~y$r_buff1_thd3~0_In-2114414610) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-2114414610|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2114414610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114414610, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2114414610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114414610} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2114414610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114414610, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-2114414610|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2114414610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114414610} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:52:07,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:52:07,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:52:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-150570987 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-150570987 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-150570987| |ULTIMATE.start_main_#t~ite25_Out-150570987|))) (or (and (or .cse0 .cse1) (= ~y~0_In-150570987 |ULTIMATE.start_main_#t~ite24_Out-150570987|) .cse2) (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out-150570987| ~y$w_buff1~0_In-150570987)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-150570987, ~y~0=~y~0_In-150570987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-150570987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-150570987} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-150570987, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-150570987|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-150570987|, ~y~0=~y~0_In-150570987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-150570987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-150570987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:52:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In12134316 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In12134316 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out12134316| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out12134316| ~y$w_buff0_used~0_In12134316) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In12134316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In12134316} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In12134316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In12134316, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out12134316|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:52:07,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-799324565 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-799324565 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-799324565 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-799324565 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-799324565|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-799324565 |ULTIMATE.start_main_#t~ite27_Out-799324565|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-799324565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799324565, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799324565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799324565} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-799324565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-799324565, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-799324565|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-799324565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799324565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:52:07,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In739224530 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In739224530 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out739224530| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out739224530| ~y$r_buff0_thd0~0_In739224530)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In739224530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In739224530} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out739224530|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In739224530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In739224530} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:52:07,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-208853999 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-208853999 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-208853999 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-208853999 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-208853999 |ULTIMATE.start_main_#t~ite29_Out-208853999|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-208853999|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-208853999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208853999, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-208853999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-208853999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-208853999, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-208853999|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208853999, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-208853999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-208853999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:52:07,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In879044200 256) 0))) (or (and (= ~y$w_buff1~0_In879044200 |ULTIMATE.start_main_#t~ite39_Out879044200|) (= |ULTIMATE.start_main_#t~ite38_In879044200| |ULTIMATE.start_main_#t~ite38_Out879044200|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In879044200 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In879044200 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In879044200 256) 0)) (= (mod ~y$w_buff0_used~0_In879044200 256) 0))) (= ~y$w_buff1~0_In879044200 |ULTIMATE.start_main_#t~ite38_Out879044200|) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out879044200| |ULTIMATE.start_main_#t~ite38_Out879044200|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In879044200, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879044200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879044200, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In879044200|, ~weak$$choice2~0=~weak$$choice2~0_In879044200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In879044200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879044200} OutVars{~y$w_buff1~0=~y$w_buff1~0_In879044200, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879044200, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out879044200|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879044200, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out879044200|, ~weak$$choice2~0=~weak$$choice2~0_In879044200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In879044200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879044200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 23:52:07,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1703227056 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-1703227056 |ULTIMATE.start_main_#t~ite41_Out-1703227056|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1703227056 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1703227056 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1703227056 256))) (= 0 (mod ~y$w_buff0_used~0_In-1703227056 256)))) (= |ULTIMATE.start_main_#t~ite42_Out-1703227056| |ULTIMATE.start_main_#t~ite41_Out-1703227056|)) (and (= |ULTIMATE.start_main_#t~ite41_In-1703227056| |ULTIMATE.start_main_#t~ite41_Out-1703227056|) (= ~y$w_buff0_used~0_In-1703227056 |ULTIMATE.start_main_#t~ite42_Out-1703227056|) (not .cse0)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-1703227056|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703227056, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1703227056, ~weak$$choice2~0=~weak$$choice2~0_In-1703227056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1703227056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1703227056} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1703227056|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703227056, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1703227056, ~weak$$choice2~0=~weak$$choice2~0_In-1703227056, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1703227056|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1703227056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1703227056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:52:07,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:52:07,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:52:07,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:52:07,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:52:07 BasicIcfg [2019-12-26 23:52:07,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:52:07,574 INFO L168 Benchmark]: Toolchain (without parser) took 74462.57 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 839.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,574 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.95 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.77 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,578 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 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:52:07,579 INFO L168 Benchmark]: RCFGBuilder took 855.54 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,580 INFO L168 Benchmark]: TraceAbstraction took 72733.64 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 781.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:07,590 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.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.95 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.77 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.00 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.54 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72733.64 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 781.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3094 SDtfs, 2683 SDslu, 6001 SDs, 0 SdLazy, 4371 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 54 SyntacticMatches, 18 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred 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: 30.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 64053 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 151993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...