/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:00:32,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:00:32,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:00:32,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:00:32,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:00:32,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:00:32,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:00:32,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:00:32,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:00:32,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:00:32,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:00:32,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:00:32,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:00:32,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:00:32,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:00:32,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:00:32,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:00:32,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:00:32,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:00:32,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:00:32,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:00:32,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:00:32,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:00:32,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:00:32,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:00:32,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:00:32,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:00:32,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:00:32,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:00:32,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:00:32,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:00:32,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:00:32,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:00:32,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:00:32,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:00:32,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:00:32,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:00:32,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:00:32,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:00:32,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:00:32,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:00:32,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:00:32,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:00:32,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:00:32,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:00:32,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:00:32,928 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:00:32,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:00:32,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:00:32,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:00:32,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:00:32,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:00:32,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:00:32,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:00:32,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:00:32,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:00:32,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:00:32,930 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:00:32,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:00:32,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:00:32,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:00:32,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:00:32,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:00:32,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:00:32,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:00:32,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:00:32,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:00:32,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:00:32,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:00:32,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:00:32,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:00:33,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:00:33,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:00:33,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:00:33,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:00:33,250 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:00:33,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-18 17:00:33,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16557623/89a56a4e16ba4ed29848a252feb9759e/FLAG217e61653 [2019-12-18 17:00:33,841 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:00:33,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-18 17:00:33,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16557623/89a56a4e16ba4ed29848a252feb9759e/FLAG217e61653 [2019-12-18 17:00:34,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16557623/89a56a4e16ba4ed29848a252feb9759e [2019-12-18 17:00:34,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:00:34,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:00:34,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:00:34,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:00:34,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:00:34,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:34,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7cabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34, skipping insertion in model container [2019-12-18 17:00:34,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:34,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:00:34,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:00:34,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:00:34,764 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:00:34,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:00:34,918 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:00:34,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34 WrapperNode [2019-12-18 17:00:34,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:00:34,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:00:34,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:00:34,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:00:34,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:34,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:34,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:00:34,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:00:34,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:00:34,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:00:34,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:34,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (1/1) ... [2019-12-18 17:00:35,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:00:35,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:00:35,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:00:35,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:00:35,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (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-18 17:00:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:00:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:00:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:00:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:00:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:00:35,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:00:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:00:35,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:00:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:00:35,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:00:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:00:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:00:35,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:00:35,096 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:00:35,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:00:35,873 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:00:35,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:00:35 BoogieIcfgContainer [2019-12-18 17:00:35,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:00:35,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:00:35,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:00:35,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:00:35,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:00:34" (1/3) ... [2019-12-18 17:00:35,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e53bbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:00:35, skipping insertion in model container [2019-12-18 17:00:35,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:00:34" (2/3) ... [2019-12-18 17:00:35,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e53bbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:00:35, skipping insertion in model container [2019-12-18 17:00:35,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:00:35" (3/3) ... [2019-12-18 17:00:35,883 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2019-12-18 17:00:35,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:00:35,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:00:35,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:00:35,903 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:00:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:35,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:00:36,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:00:36,053 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:00:36,053 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:00:36,053 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:00:36,053 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:00:36,053 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:00:36,054 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:00:36,054 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:00:36,054 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:00:36,076 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:00:36,078 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:00:36,167 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:00:36,167 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:00:36,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:00:36,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:00:36,258 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:00:36,258 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:00:36,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:00:36,286 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 17:00:36,287 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:00:39,039 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-18 17:00:40,943 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:00:41,095 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:00:41,122 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-18 17:00:41,122 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 17:00:41,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 17:00:58,684 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-18 17:00:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-18 17:00:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:00:58,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:58,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:00:58,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-18 17:00:58,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:58,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119618113] [2019-12-18 17:00:58,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:58,920 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-18 17:00:58,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119618113] [2019-12-18 17:00:58,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:58,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:00:58,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588546344] [2019-12-18 17:00:58,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:58,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:58,941 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-18 17:01:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:02,028 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-18 17:01:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:02,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:01:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:02,836 INFO L225 Difference]: With dead ends: 114778 [2019-12-18 17:01:02,836 INFO L226 Difference]: Without dead ends: 112412 [2019-12-18 17:01:02,839 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-18 17:01:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-18 17:01:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-18 17:01:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-18 17:01:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-18 17:01:12,734 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-18 17:01:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:12,735 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-18 17:01:12,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-18 17:01:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:01:12,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:12,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:12,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-18 17:01:12,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:12,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145981173] [2019-12-18 17:01:12,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:12,853 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-18 17:01:12,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145981173] [2019-12-18 17:01:12,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:12,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:12,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514225441] [2019-12-18 17:01:12,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:12,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:12,857 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-18 17:01:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:19,046 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-18 17:01:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:01:19,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:01:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:19,670 INFO L225 Difference]: With dead ends: 180702 [2019-12-18 17:01:19,671 INFO L226 Difference]: Without dead ends: 180653 [2019-12-18 17:01:19,671 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-18 17:01:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-18 17:01:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-18 17:01:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-18 17:01:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-18 17:01:35,338 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-18 17:01:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:35,338 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-18 17:01:35,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-18 17:01:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:01:35,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:35,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:35,347 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-18 17:01:35,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:35,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197257748] [2019-12-18 17:01:35,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:35,438 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-18 17:01:35,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197257748] [2019-12-18 17:01:35,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:35,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:35,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710148468] [2019-12-18 17:01:35,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:35,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:35,441 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-18 17:01:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:38,369 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-18 17:01:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:01:38,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:01:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:39,071 INFO L225 Difference]: With dead ends: 235681 [2019-12-18 17:01:39,071 INFO L226 Difference]: Without dead ends: 235618 [2019-12-18 17:01:39,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-18 17:01:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-18 17:01:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-18 17:01:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-18 17:01:56,017 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-18 17:01:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:56,018 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-18 17:01:56,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-18 17:01:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:01:56,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:56,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:56,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-18 17:01:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:56,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170743317] [2019-12-18 17:01:56,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:56,077 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-18 17:01:56,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170743317] [2019-12-18 17:01:56,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:56,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:56,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597000650] [2019-12-18 17:01:56,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:56,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:56,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:56,081 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-18 17:01:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:56,221 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-18 17:01:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:56,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:01:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:56,293 INFO L225 Difference]: With dead ends: 39466 [2019-12-18 17:01:56,294 INFO L226 Difference]: Without dead ends: 39466 [2019-12-18 17:01:56,294 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-18 17:01:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-18 17:02:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-18 17:02:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-18 17:02:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-18 17:02:02,416 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-18 17:02:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:02,416 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-18 17:02:02,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-18 17:02:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:02:02,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:02,420 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-18 17:02:02,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-18 17:02:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:02,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842563463] [2019-12-18 17:02:02,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:02,505 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-18 17:02:02,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842563463] [2019-12-18 17:02:02,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:02,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:02:02,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026157479] [2019-12-18 17:02:02,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:02:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:02:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:02:02,507 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-18 17:02:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:03,255 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-18 17:02:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:02:03,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:02:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:03,343 INFO L225 Difference]: With dead ends: 53323 [2019-12-18 17:02:03,344 INFO L226 Difference]: Without dead ends: 53310 [2019-12-18 17:02:03,344 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-18 17:02:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-18 17:02:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-18 17:02:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-18 17:02:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-18 17:02:04,457 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-18 17:02:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:04,457 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-18 17:02:04,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:02:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-18 17:02:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:02:04,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:04,470 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-18 17:02:04,470 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-18 17:02:04,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:04,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331326278] [2019-12-18 17:02:04,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:04,539 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-18 17:02:04,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331326278] [2019-12-18 17:02:04,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:04,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:02:04,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596323357] [2019-12-18 17:02:04,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:04,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:04,541 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-18 17:02:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:04,583 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-18 17:02:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:02:04,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:02:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:04,597 INFO L225 Difference]: With dead ends: 7581 [2019-12-18 17:02:04,598 INFO L226 Difference]: Without dead ends: 7581 [2019-12-18 17:02:04,598 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-18 17:02:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-18 17:02:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-18 17:02:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-18 17:02:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-18 17:02:04,707 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-18 17:02:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:04,707 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-18 17:02:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:02:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-18 17:02:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:02:04,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:04,719 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-18 17:02:04,719 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-18 17:02:04,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:04,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828521018] [2019-12-18 17:02:04,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:04,800 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-18 17:02:04,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828521018] [2019-12-18 17:02:04,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:04,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:02:04,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269144480] [2019-12-18 17:02:04,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:02:04,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:02:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:02:04,802 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-18 17:02:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:04,841 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-18 17:02:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:02:04,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 17:02:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:04,853 INFO L225 Difference]: With dead ends: 5402 [2019-12-18 17:02:04,854 INFO L226 Difference]: Without dead ends: 5402 [2019-12-18 17:02:04,854 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-18 17:02:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-18 17:02:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-18 17:02:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-18 17:02:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-18 17:02:04,926 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-18 17:02:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:04,926 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-18 17:02:04,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:02:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-18 17:02:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:02:04,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:04,934 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-18 17:02:04,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-18 17:02:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:04,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934714130] [2019-12-18 17:02:04,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:05,022 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-18 17:02:05,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934714130] [2019-12-18 17:02:05,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:05,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:02:05,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494950652] [2019-12-18 17:02:05,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:05,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:05,025 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-18 17:02:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:05,087 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-18 17:02:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:05,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:02:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:05,097 INFO L225 Difference]: With dead ends: 4998 [2019-12-18 17:02:05,098 INFO L226 Difference]: Without dead ends: 4998 [2019-12-18 17:02:05,098 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-18 17:02:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-18 17:02:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-18 17:02:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 17:02:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-18 17:02:05,213 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-18 17:02:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:05,214 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-18 17:02:05,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-18 17:02:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:02:05,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:05,227 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-18 17:02:05,227 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-18 17:02:05,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:05,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481407699] [2019-12-18 17:02:05,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:05,437 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-18 17:02:05,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481407699] [2019-12-18 17:02:05,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:05,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:02:05,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864475754] [2019-12-18 17:02:05,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:02:05,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:02:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:02:05,440 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 5 states. [2019-12-18 17:02:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:05,806 INFO L93 Difference]: Finished difference Result 7928 states and 22567 transitions. [2019-12-18 17:02:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:02:05,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 17:02:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:05,819 INFO L225 Difference]: With dead ends: 7928 [2019-12-18 17:02:05,819 INFO L226 Difference]: Without dead ends: 7928 [2019-12-18 17:02:05,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:02:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7928 states. [2019-12-18 17:02:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7928 to 5806. [2019-12-18 17:02:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5806 states. [2019-12-18 17:02:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 16813 transitions. [2019-12-18 17:02:05,913 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 16813 transitions. Word has length 65 [2019-12-18 17:02:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:05,913 INFO L462 AbstractCegarLoop]: Abstraction has 5806 states and 16813 transitions. [2019-12-18 17:02:05,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:02:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 16813 transitions. [2019-12-18 17:02:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:02:05,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:05,921 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-18 17:02:05,921 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 343857822, now seen corresponding path program 2 times [2019-12-18 17:02:05,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:05,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362827197] [2019-12-18 17:02:05,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:06,023 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-18 17:02:06,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362827197] [2019-12-18 17:02:06,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:06,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:02:06,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194850796] [2019-12-18 17:02:06,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:02:06,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:02:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:02:06,026 INFO L87 Difference]: Start difference. First operand 5806 states and 16813 transitions. Second operand 6 states. [2019-12-18 17:02:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:06,559 INFO L93 Difference]: Finished difference Result 9867 states and 28335 transitions. [2019-12-18 17:02:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:02:06,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:02:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:06,579 INFO L225 Difference]: With dead ends: 9867 [2019-12-18 17:02:06,579 INFO L226 Difference]: Without dead ends: 9867 [2019-12-18 17:02:06,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-18 17:02:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2019-12-18 17:02:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 6339. [2019-12-18 17:02:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-12-18 17:02:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 18398 transitions. [2019-12-18 17:02:06,755 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 18398 transitions. Word has length 65 [2019-12-18 17:02:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:06,755 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 18398 transitions. [2019-12-18 17:02:06,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:02:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 18398 transitions. [2019-12-18 17:02:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:02:06,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:06,768 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-18 17:02:06,769 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1151551294, now seen corresponding path program 3 times [2019-12-18 17:02:06,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:06,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925291890] [2019-12-18 17:02:06,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:06,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925291890] [2019-12-18 17:02:06,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:06,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:02:06,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370154353] [2019-12-18 17:02:06,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:02:06,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:06,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:02:06,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:02:06,954 INFO L87 Difference]: Start difference. First operand 6339 states and 18398 transitions. Second operand 6 states. [2019-12-18 17:02:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:07,640 INFO L93 Difference]: Finished difference Result 8650 states and 24438 transitions. [2019-12-18 17:02:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:02:07,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:02:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:07,651 INFO L225 Difference]: With dead ends: 8650 [2019-12-18 17:02:07,651 INFO L226 Difference]: Without dead ends: 8650 [2019-12-18 17:02:07,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:02:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-18 17:02:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 6900. [2019-12-18 17:02:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-12-18 17:02:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 19712 transitions. [2019-12-18 17:02:07,758 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 19712 transitions. Word has length 65 [2019-12-18 17:02:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:07,758 INFO L462 AbstractCegarLoop]: Abstraction has 6900 states and 19712 transitions. [2019-12-18 17:02:07,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:02:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 19712 transitions. [2019-12-18 17:02:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:02:07,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:07,767 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-18 17:02:07,767 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash 663923916, now seen corresponding path program 4 times [2019-12-18 17:02:07,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:07,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581135366] [2019-12-18 17:02:07,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:07,837 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-18 17:02:07,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581135366] [2019-12-18 17:02:07,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:07,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:07,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801004746] [2019-12-18 17:02:07,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:07,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:07,839 INFO L87 Difference]: Start difference. First operand 6900 states and 19712 transitions. Second operand 3 states. [2019-12-18 17:02:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:07,869 INFO L93 Difference]: Finished difference Result 6337 states and 17866 transitions. [2019-12-18 17:02:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:07,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:02:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:07,880 INFO L225 Difference]: With dead ends: 6337 [2019-12-18 17:02:07,880 INFO L226 Difference]: Without dead ends: 6337 [2019-12-18 17:02:07,880 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-18 17:02:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-12-18 17:02:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6169. [2019-12-18 17:02:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6169 states. [2019-12-18 17:02:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 17400 transitions. [2019-12-18 17:02:08,023 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 17400 transitions. Word has length 65 [2019-12-18 17:02:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:08,024 INFO L462 AbstractCegarLoop]: Abstraction has 6169 states and 17400 transitions. [2019-12-18 17:02:08,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 17400 transitions. [2019-12-18 17:02:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:02:08,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:08,038 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-18 17:02:08,039 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 1 times [2019-12-18 17:02:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:08,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768194013] [2019-12-18 17:02:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:08,158 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-18 17:02:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768194013] [2019-12-18 17:02:08,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:08,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:02:08,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404146038] [2019-12-18 17:02:08,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:02:08,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:02:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:02:08,166 INFO L87 Difference]: Start difference. First operand 6169 states and 17400 transitions. Second operand 6 states. [2019-12-18 17:02:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:08,613 INFO L93 Difference]: Finished difference Result 8320 states and 23209 transitions. [2019-12-18 17:02:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:02:08,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 17:02:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:08,626 INFO L225 Difference]: With dead ends: 8320 [2019-12-18 17:02:08,626 INFO L226 Difference]: Without dead ends: 8320 [2019-12-18 17:02:08,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:02:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2019-12-18 17:02:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 6561. [2019-12-18 17:02:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2019-12-18 17:02:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 18492 transitions. [2019-12-18 17:02:08,760 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 18492 transitions. Word has length 66 [2019-12-18 17:02:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:08,760 INFO L462 AbstractCegarLoop]: Abstraction has 6561 states and 18492 transitions. [2019-12-18 17:02:08,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:02:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 18492 transitions. [2019-12-18 17:02:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:02:08,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:08,770 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-18 17:02:08,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 2 times [2019-12-18 17:02:08,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:08,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937576844] [2019-12-18 17:02:08,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:08,835 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-18 17:02:08,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937576844] [2019-12-18 17:02:08,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:08,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:08,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146589007] [2019-12-18 17:02:08,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:08,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:08,837 INFO L87 Difference]: Start difference. First operand 6561 states and 18492 transitions. Second operand 3 states. [2019-12-18 17:02:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:08,865 INFO L93 Difference]: Finished difference Result 5918 states and 16475 transitions. [2019-12-18 17:02:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:08,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:02:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:08,876 INFO L225 Difference]: With dead ends: 5918 [2019-12-18 17:02:08,877 INFO L226 Difference]: Without dead ends: 5918 [2019-12-18 17:02:08,878 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-18 17:02:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2019-12-18 17:02:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 5750. [2019-12-18 17:02:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5750 states. [2019-12-18 17:02:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 16023 transitions. [2019-12-18 17:02:08,989 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 16023 transitions. Word has length 66 [2019-12-18 17:02:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 5750 states and 16023 transitions. [2019-12-18 17:02:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 16023 transitions. [2019-12-18 17:02:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:02:09,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:09,004 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-18 17:02:09,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 220867955, now seen corresponding path program 1 times [2019-12-18 17:02:09,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:09,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8711015] [2019-12-18 17:02:09,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:09,088 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-18 17:02:09,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8711015] [2019-12-18 17:02:09,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:09,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:09,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817162574] [2019-12-18 17:02:09,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:09,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:09,090 INFO L87 Difference]: Start difference. First operand 5750 states and 16023 transitions. Second operand 3 states. [2019-12-18 17:02:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:09,148 INFO L93 Difference]: Finished difference Result 5750 states and 16022 transitions. [2019-12-18 17:02:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:09,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:02:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:09,156 INFO L225 Difference]: With dead ends: 5750 [2019-12-18 17:02:09,156 INFO L226 Difference]: Without dead ends: 5750 [2019-12-18 17:02:09,157 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-18 17:02:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2019-12-18 17:02:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 3409. [2019-12-18 17:02:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-18 17:02:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 9568 transitions. [2019-12-18 17:02:09,233 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 9568 transitions. Word has length 67 [2019-12-18 17:02:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:09,233 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 9568 transitions. [2019-12-18 17:02:09,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 9568 transitions. [2019-12-18 17:02:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:02:09,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:09,238 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-18 17:02:09,238 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-18 17:02:09,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:09,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472294527] [2019-12-18 17:02:09,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:09,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472294527] [2019-12-18 17:02:09,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:09,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:02:09,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495883891] [2019-12-18 17:02:09,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:02:09,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:02:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:02:09,454 INFO L87 Difference]: Start difference. First operand 3409 states and 9568 transitions. Second operand 10 states. [2019-12-18 17:02:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:09,794 INFO L93 Difference]: Finished difference Result 7633 states and 21615 transitions. [2019-12-18 17:02:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:02:09,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-18 17:02:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:09,800 INFO L225 Difference]: With dead ends: 7633 [2019-12-18 17:02:09,800 INFO L226 Difference]: Without dead ends: 5041 [2019-12-18 17:02:09,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:02:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2019-12-18 17:02:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 3442. [2019-12-18 17:02:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-12-18 17:02:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 9632 transitions. [2019-12-18 17:02:09,860 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 9632 transitions. Word has length 68 [2019-12-18 17:02:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:09,860 INFO L462 AbstractCegarLoop]: Abstraction has 3442 states and 9632 transitions. [2019-12-18 17:02:09,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:02:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 9632 transitions. [2019-12-18 17:02:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:02:09,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:09,864 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-18 17:02:09,864 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash -256019789, now seen corresponding path program 2 times [2019-12-18 17:02:09,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:09,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34963759] [2019-12-18 17:02:09,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:10,055 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-18 17:02:10,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34963759] [2019-12-18 17:02:10,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:10,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:02:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291125081] [2019-12-18 17:02:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:02:10,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:02:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:02:10,058 INFO L87 Difference]: Start difference. First operand 3442 states and 9632 transitions. Second operand 10 states. [2019-12-18 17:02:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:10,504 INFO L93 Difference]: Finished difference Result 7018 states and 19791 transitions. [2019-12-18 17:02:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:02:10,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-18 17:02:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:10,513 INFO L225 Difference]: With dead ends: 7018 [2019-12-18 17:02:10,513 INFO L226 Difference]: Without dead ends: 4180 [2019-12-18 17:02:10,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:02:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2019-12-18 17:02:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 2821. [2019-12-18 17:02:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-18 17:02:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 7861 transitions. [2019-12-18 17:02:10,597 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 7861 transitions. Word has length 68 [2019-12-18 17:02:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:10,597 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 7861 transitions. [2019-12-18 17:02:10,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:02:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 7861 transitions. [2019-12-18 17:02:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:02:10,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:10,602 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-18 17:02:10,602 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:10,602 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 3 times [2019-12-18 17:02:10,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:10,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201775998] [2019-12-18 17:02:10,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:10,762 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-18 17:02:10,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201775998] [2019-12-18 17:02:10,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:10,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:02:10,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108275330] [2019-12-18 17:02:10,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:02:10,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:02:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:02:10,766 INFO L87 Difference]: Start difference. First operand 2821 states and 7861 transitions. Second operand 6 states. [2019-12-18 17:02:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:10,864 INFO L93 Difference]: Finished difference Result 5160 states and 14410 transitions. [2019-12-18 17:02:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:02:10,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 17:02:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:10,868 INFO L225 Difference]: With dead ends: 5160 [2019-12-18 17:02:10,869 INFO L226 Difference]: Without dead ends: 2281 [2019-12-18 17:02:10,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:02:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-12-18 17:02:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1897. [2019-12-18 17:02:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-12-18 17:02:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 5235 transitions. [2019-12-18 17:02:10,917 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 5235 transitions. Word has length 68 [2019-12-18 17:02:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:10,917 INFO L462 AbstractCegarLoop]: Abstraction has 1897 states and 5235 transitions. [2019-12-18 17:02:10,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:02:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 5235 transitions. [2019-12-18 17:02:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:02:10,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:10,921 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-18 17:02:10,921 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 4 times [2019-12-18 17:02:10,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:10,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130616049] [2019-12-18 17:02:10,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:11,237 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:02:11,237 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:02:11,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_23) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= 0 v_~x$r_buff0_thd3~0_99) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20| 1)) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t748~0.base_20| 4)) (= v_~x$mem_tmp~0_22 0) (= v_~__unbuffered_p2_EBX~0_23 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20|) |v_ULTIMATE.start_main_~#t748~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t748~0.base_20|) (= v_~__unbuffered_cnt~0_145 0) (= |v_ULTIMATE.start_main_~#t748~0.offset_17| 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20|)) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start_main_~#t748~0.base=|v_ULTIMATE.start_main_~#t748~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_~#t748~0.offset=|v_ULTIMATE.start_main_~#t748~0.offset_17|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t749~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t748~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t750~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t748~0.offset, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t749~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t750~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:02:11,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t749~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t749~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13|) |v_ULTIMATE.start_main_~#t749~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t749~0.base_13|) (= |v_ULTIMATE.start_main_~#t749~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_11|, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t749~0.offset, ULTIMATE.start_main_~#t749~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:02:11,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13|) |v_ULTIMATE.start_main_~#t750~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t750~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t750~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t750~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t750~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t750~0.offset, #length, ULTIMATE.start_main_~#t750~0.base] because there is no mapped edge [2019-12-18 17:02:11,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:02:11,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-702902351 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-702902351 256)))) (or (and (= ~x~0_In-702902351 |P2Thread1of1ForFork2_#t~ite15_Out-702902351|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-702902351| ~x$w_buff1~0_In-702902351) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-702902351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-702902351, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-702902351, ~x~0=~x~0_In-702902351} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-702902351|, ~x$w_buff1~0=~x$w_buff1~0_In-702902351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-702902351, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-702902351, ~x~0=~x~0_In-702902351} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 17:02:11,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 17:02:11,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1363912002 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1363912002 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1363912002| |P0Thread1of1ForFork0_#t~ite4_Out1363912002|))) (or (and (or .cse0 .cse1) (= ~x~0_In1363912002 |P0Thread1of1ForFork0_#t~ite3_Out1363912002|) .cse2) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1363912002 |P0Thread1of1ForFork0_#t~ite3_Out1363912002|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1363912002, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363912002, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1363912002, ~x~0=~x~0_In1363912002} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1363912002|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1363912002|, ~x$w_buff1~0=~x$w_buff1~0_In1363912002, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363912002, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1363912002, ~x~0=~x~0_In1363912002} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:02:11,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-212002743 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-212002743 256) 0))) (or (and (= ~x$w_buff0_used~0_In-212002743 |P0Thread1of1ForFork0_#t~ite5_Out-212002743|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-212002743|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-212002743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-212002743} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-212002743|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-212002743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-212002743} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:02:11,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-448222042 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-448222042 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-448222042 |P2Thread1of1ForFork2_#t~ite17_Out-448222042|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-448222042|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-448222042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-448222042} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-448222042, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-448222042|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-448222042} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 17:02:11,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1716209914 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1716209914 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1716209914 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1716209914 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1716209914| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1716209914 |P2Thread1of1ForFork2_#t~ite18_Out-1716209914|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1716209914, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1716209914, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1716209914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1716209914} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1716209914, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1716209914, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1716209914, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1716209914|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1716209914} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 17:02:11,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1128096851 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1128096851 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1128096851 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1128096851 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1128096851| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1128096851| ~x$w_buff1_used~0_In-1128096851)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1128096851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1128096851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1128096851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1128096851} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1128096851|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1128096851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1128096851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1128096851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1128096851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:02:11,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1812191599 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1812191599 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1812191599|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In1812191599 |P2Thread1of1ForFork2_#t~ite19_Out1812191599|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1812191599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812191599} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1812191599, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1812191599|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812191599} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 17:02:11,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1626998692 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1626998692 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1626998692 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1626998692 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-1626998692| ~x$r_buff1_thd3~0_In-1626998692) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1626998692| 0)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1626998692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1626998692, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1626998692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1626998692} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1626998692|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1626998692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1626998692, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1626998692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1626998692} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 17:02:11,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:02:11,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-567046624 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-567046624 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-567046624|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-567046624 |P1Thread1of1ForFork1_#t~ite11_Out-567046624|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-567046624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-567046624} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-567046624|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-567046624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-567046624} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:02:11,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1267791693 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1267791693 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1267791693 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1267791693 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1267791693 |P1Thread1of1ForFork1_#t~ite12_Out-1267791693|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1267791693|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1267791693, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1267791693, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1267791693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267791693} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1267791693, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1267791693, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1267791693|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1267791693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267791693} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:02:11,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In722741243 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In722741243 256)))) (or (and (= ~x$r_buff0_thd2~0_Out722741243 ~x$r_buff0_thd2~0_In722741243) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out722741243 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In722741243, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722741243} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out722741243|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out722741243, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722741243} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:02:11,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1241129994 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1241129994 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1241129994 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1241129994 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1241129994|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In-1241129994 |P1Thread1of1ForFork1_#t~ite14_Out-1241129994|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1241129994, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1241129994, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1241129994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1241129994} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1241129994, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1241129994, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1241129994, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1241129994|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1241129994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:02:11,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:02:11,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In76306837 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In76306837 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In76306837 |P0Thread1of1ForFork0_#t~ite7_Out76306837|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out76306837|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76306837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76306837} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76306837, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out76306837|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76306837} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:02:11,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In197114909 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In197114909 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In197114909 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In197114909 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out197114909| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out197114909| ~x$r_buff1_thd1~0_In197114909) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In197114909, ~x$w_buff1_used~0=~x$w_buff1_used~0_In197114909, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In197114909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In197114909} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In197114909, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out197114909|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In197114909, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In197114909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In197114909} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:02:11,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 17:02:11,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:02:11,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-724128746 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-724128746 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-724128746| |ULTIMATE.start_main_#t~ite25_Out-724128746|))) (or (and (= ~x$w_buff1~0_In-724128746 |ULTIMATE.start_main_#t~ite24_Out-724128746|) (not .cse0) (not .cse1) .cse2) (and (= ~x~0_In-724128746 |ULTIMATE.start_main_#t~ite24_Out-724128746|) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-724128746, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-724128746, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-724128746, ~x~0=~x~0_In-724128746} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-724128746, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-724128746|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-724128746|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-724128746, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-724128746, ~x~0=~x~0_In-724128746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 17:02:11,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1883440570 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1883440570 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1883440570|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1883440570 |ULTIMATE.start_main_#t~ite26_Out1883440570|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1883440570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1883440570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1883440570, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1883440570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1883440570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 17:02:11,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1117764164 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1117764164 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1117764164 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1117764164 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1117764164| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite27_Out-1117764164| ~x$w_buff1_used~0_In-1117764164) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1117764164, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1117764164, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1117764164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117764164} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1117764164, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1117764164, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1117764164|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1117764164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117764164} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 17:02:11,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1188205431 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1188205431 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1188205431 |ULTIMATE.start_main_#t~ite28_Out1188205431|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1188205431|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1188205431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1188205431} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1188205431, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1188205431|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1188205431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 17:02:11,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In436904372 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In436904372 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In436904372 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In436904372 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out436904372|)) (and (= ~x$r_buff1_thd0~0_In436904372 |ULTIMATE.start_main_#t~ite29_Out436904372|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436904372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In436904372, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In436904372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436904372} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436904372, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out436904372|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In436904372, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In436904372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436904372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:02:11,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$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-18 17:02:11,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:02:11,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:02:11,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:02:11 BasicIcfg [2019-12-18 17:02:11,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:02:11,373 INFO L168 Benchmark]: Toolchain (without parser) took 97234.13 ms. Allocated memory was 138.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,375 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,377 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,377 INFO L168 Benchmark]: RCFGBuilder took 845.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,379 INFO L168 Benchmark]: TraceAbstraction took 95494.85 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:11,382 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.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.49 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95494.85 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2763 SDtfs, 2501 SDslu, 5618 SDs, 0 SdLazy, 2811 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 80289 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 162403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...