/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/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:26:39,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:26:39,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:26:39,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:26:39,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:26:39,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:26:39,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:26:39,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:26:39,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:26:39,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:26:39,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:26:39,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:26:39,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:26:39,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:26:39,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:26:39,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:26:39,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:26:39,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:26:39,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:26:39,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:26:39,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:26:39,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:26:39,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:26:39,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:26:39,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:26:39,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:26:39,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:26:39,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:26:39,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:26:39,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:26:39,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:26:39,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:26:39,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:26:39,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:26:39,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:26:39,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:26:40,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:26:40,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:26:40,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:26:40,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:26:40,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:26:40,003 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:26:40,022 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:26:40,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:26:40,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:26:40,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:26:40,026 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:26:40,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:26:40,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:26:40,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:26:40,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:26:40,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:26:40,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:26:40,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:26:40,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:26:40,028 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:26:40,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:26:40,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:26:40,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:26:40,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:26:40,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:26:40,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:26:40,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:26:40,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:26:40,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:26:40,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:26:40,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:26:40,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:26:40,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:26:40,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:26:40,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:26:40,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:26:40,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:26:40,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:26:40,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:26:40,320 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:26:40,321 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-18 17:26:40,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aeec3615/660fe3f7711d4f88824d60d8c3ef7cee/FLAG9aab56248 [2019-12-18 17:26:40,927 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:26:40,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-18 17:26:40,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aeec3615/660fe3f7711d4f88824d60d8c3ef7cee/FLAG9aab56248 [2019-12-18 17:26:41,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aeec3615/660fe3f7711d4f88824d60d8c3ef7cee [2019-12-18 17:26:41,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:26:41,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:26:41,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:41,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:26:41,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:26:41,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:41" (1/1) ... [2019-12-18 17:26:41,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192be1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:41, skipping insertion in model container [2019-12-18 17:26:41,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:41" (1/1) ... [2019-12-18 17:26:41,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:26:41,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:26:41,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:41,841 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:26:41,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:42,013 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:26:42,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42 WrapperNode [2019-12-18 17:26:42,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:42,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:42,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:26:42,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:26:42,024 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:26:42" (1/1) ... [2019-12-18 17:26:42,054 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:26:42" (1/1) ... [2019-12-18 17:26:42,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:42,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:26:42,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:26:42,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:26:42,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (1/1) ... [2019-12-18 17:26:42,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:26:42,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:26:42,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:26:42,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:26:42,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (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:26:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:26:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:26:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:26:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:26:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:26:42,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:26:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:26:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:26:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:26:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:26:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:26:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:26:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:26:42,213 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:26:42,998 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:26:42,998 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:26:42,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:42 BoogieIcfgContainer [2019-12-18 17:26:43,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:26:43,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:26:43,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:26:43,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:26:43,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:26:41" (1/3) ... [2019-12-18 17:26:43,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fac58d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:43, skipping insertion in model container [2019-12-18 17:26:43,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:42" (2/3) ... [2019-12-18 17:26:43,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fac58d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:43, skipping insertion in model container [2019-12-18 17:26:43,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:42" (3/3) ... [2019-12-18 17:26:43,009 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-18 17:26:43,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:26:43,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:26:43,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:26:43,028 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:26:43,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,085 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,088 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,088 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,131 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,132 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:43,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:26:43,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:26:43,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:26:43,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:26:43,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:26:43,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:26:43,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:26:43,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:26:43,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:26:43,188 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 17:26:43,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:26:43,270 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:26:43,270 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:43,284 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:26:43,305 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:26:43,366 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:26:43,367 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:43,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:26:43,391 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:26:43,392 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:26:48,004 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 17:26:48,469 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:26:48,601 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:26:48,628 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 17:26:48,628 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 17:26:48,631 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 17:26:49,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 17:26:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 17:26:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:26:49,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:49,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:49,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 17:26:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:49,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580826565] [2019-12-18 17:26:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:49,926 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:26:49,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580826565] [2019-12-18 17:26:49,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:49,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:26:49,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535403430] [2019-12-18 17:26:49,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:49,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:49,950 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 17:26:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:50,259 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 17:26:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:50,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:26:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:50,407 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 17:26:50,408 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 17:26:50,409 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:26:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 17:26:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 17:26:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 17:26:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 17:26:51,139 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 17:26:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:51,140 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 17:26:51,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:26:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 17:26:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:26:51,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:51,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:51,151 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 17:26:51,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:51,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495541459] [2019-12-18 17:26:51,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:51,268 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:26:51,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495541459] [2019-12-18 17:26:51,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:51,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:26:51,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795230031] [2019-12-18 17:26:51,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:26:51,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:26:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:26:51,271 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 17:26:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:51,591 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 17:26:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:26:51,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:26:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:52,580 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 17:26:52,580 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 17:26:52,581 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:26:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 17:26:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 17:26:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 17:26:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 17:26:53,306 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 17:26:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:53,307 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 17:26:53,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:26:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 17:26:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:26:53,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:53,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:53,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 17:26:53,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:53,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037172846] [2019-12-18 17:26:53,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:53,398 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:26:53,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037172846] [2019-12-18 17:26:53,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:53,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:26:53,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571746376] [2019-12-18 17:26:53,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:26:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:26:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:26:53,401 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 17:26:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:53,767 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 17:26:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:26:53,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:26:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:53,866 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 17:26:53,867 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 17:26:53,867 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:26:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 17:26:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 17:26:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 17:26:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 17:26:54,874 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 17:26:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:54,874 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 17:26:54,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:26:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 17:26:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:26:54,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:54,882 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:26:54,883 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 17:26:54,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:54,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516960041] [2019-12-18 17:26:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:54,973 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:26:54,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516960041] [2019-12-18 17:26:54,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:54,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:26:54,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100676974] [2019-12-18 17:26:54,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:26:54,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:54,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:26:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:26:54,976 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-18 17:26:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:56,522 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-18 17:26:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:26:56,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:26:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:56,599 INFO L225 Difference]: With dead ends: 30132 [2019-12-18 17:26:56,599 INFO L226 Difference]: Without dead ends: 30118 [2019-12-18 17:26:56,601 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:26:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-18 17:26:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-18 17:26:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-18 17:26:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-18 17:26:57,427 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-18 17:26:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:57,427 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-18 17:26:57,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:26:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-18 17:26:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:26:57,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:57,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:57,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-18 17:26:57,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:57,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745603715] [2019-12-18 17:26:57,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:57,566 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:26:57,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745603715] [2019-12-18 17:26:57,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:57,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:26:57,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666170378] [2019-12-18 17:26:57,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:26:57,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:57,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:26:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:26:57,569 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 6 states. [2019-12-18 17:26:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:58,224 INFO L93 Difference]: Finished difference Result 32606 states and 115328 transitions. [2019-12-18 17:26:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:26:58,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:26:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:58,283 INFO L225 Difference]: With dead ends: 32606 [2019-12-18 17:26:58,284 INFO L226 Difference]: Without dead ends: 32574 [2019-12-18 17:26:58,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:26:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32574 states. [2019-12-18 17:26:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32574 to 28036. [2019-12-18 17:26:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28036 states. [2019-12-18 17:26:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28036 states to 28036 states and 100001 transitions. [2019-12-18 17:26:59,270 INFO L78 Accepts]: Start accepts. Automaton has 28036 states and 100001 transitions. Word has length 27 [2019-12-18 17:26:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:59,270 INFO L462 AbstractCegarLoop]: Abstraction has 28036 states and 100001 transitions. [2019-12-18 17:26:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:26:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28036 states and 100001 transitions. [2019-12-18 17:26:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:26:59,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:59,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:59,304 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1188296037, now seen corresponding path program 1 times [2019-12-18 17:26:59,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:59,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525346561] [2019-12-18 17:26:59,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:59,364 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:26:59,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525346561] [2019-12-18 17:26:59,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:59,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:26:59,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424796937] [2019-12-18 17:26:59,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:59,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:59,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:59,368 INFO L87 Difference]: Start difference. First operand 28036 states and 100001 transitions. Second operand 3 states. [2019-12-18 17:26:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:59,585 INFO L93 Difference]: Finished difference Result 35568 states and 127677 transitions. [2019-12-18 17:26:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:59,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 17:26:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:59,654 INFO L225 Difference]: With dead ends: 35568 [2019-12-18 17:26:59,654 INFO L226 Difference]: Without dead ends: 35568 [2019-12-18 17:26:59,654 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:26:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35568 states. [2019-12-18 17:27:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35568 to 31188. [2019-12-18 17:27:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-18 17:27:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112337 transitions. [2019-12-18 17:27:00,644 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112337 transitions. Word has length 33 [2019-12-18 17:27:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:00,644 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112337 transitions. [2019-12-18 17:27:00,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112337 transitions. [2019-12-18 17:27:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:00,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:00,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:00,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1536973783, now seen corresponding path program 1 times [2019-12-18 17:27:00,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:00,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893297156] [2019-12-18 17:27:00,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:00,745 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:27:00,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893297156] [2019-12-18 17:27:00,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:00,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:00,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631644953] [2019-12-18 17:27:00,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:00,747 INFO L87 Difference]: Start difference. First operand 31188 states and 112337 transitions. Second operand 3 states. [2019-12-18 17:27:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:00,902 INFO L93 Difference]: Finished difference Result 31188 states and 112001 transitions. [2019-12-18 17:27:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:00,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 17:27:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:00,960 INFO L225 Difference]: With dead ends: 31188 [2019-12-18 17:27:00,960 INFO L226 Difference]: Without dead ends: 31188 [2019-12-18 17:27:00,960 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:27:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31188 states. [2019-12-18 17:27:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31188 to 31188. [2019-12-18 17:27:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-18 17:27:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112001 transitions. [2019-12-18 17:27:02,924 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112001 transitions. Word has length 33 [2019-12-18 17:27:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:02,925 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112001 transitions. [2019-12-18 17:27:02,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112001 transitions. [2019-12-18 17:27:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:02,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:02,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:02,953 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1315717310, now seen corresponding path program 1 times [2019-12-18 17:27:02,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:02,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289092993] [2019-12-18 17:27:02,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:03,043 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:27:03,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289092993] [2019-12-18 17:27:03,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:03,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:03,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192554634] [2019-12-18 17:27:03,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:03,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:03,045 INFO L87 Difference]: Start difference. First operand 31188 states and 112001 transitions. Second operand 7 states. [2019-12-18 17:27:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:04,346 INFO L93 Difference]: Finished difference Result 41802 states and 147366 transitions. [2019-12-18 17:27:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:27:04,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:27:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:04,431 INFO L225 Difference]: With dead ends: 41802 [2019-12-18 17:27:04,432 INFO L226 Difference]: Without dead ends: 41750 [2019-12-18 17:27:04,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:27:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41750 states. [2019-12-18 17:27:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41750 to 27846. [2019-12-18 17:27:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27846 states. [2019-12-18 17:27:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27846 states to 27846 states and 100646 transitions. [2019-12-18 17:27:05,055 INFO L78 Accepts]: Start accepts. Automaton has 27846 states and 100646 transitions. Word has length 33 [2019-12-18 17:27:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:05,055 INFO L462 AbstractCegarLoop]: Abstraction has 27846 states and 100646 transitions. [2019-12-18 17:27:05,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27846 states and 100646 transitions. [2019-12-18 17:27:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:05,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:05,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:05,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2103492564, now seen corresponding path program 1 times [2019-12-18 17:27:05,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:05,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262634418] [2019-12-18 17:27:05,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:06,415 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:27:06,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262634418] [2019-12-18 17:27:06,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:06,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:06,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423845961] [2019-12-18 17:27:06,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:06,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:06,419 INFO L87 Difference]: Start difference. First operand 27846 states and 100646 transitions. Second operand 4 states. [2019-12-18 17:27:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:06,517 INFO L93 Difference]: Finished difference Result 16488 states and 51363 transitions. [2019-12-18 17:27:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:27:06,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 17:27:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:06,551 INFO L225 Difference]: With dead ends: 16488 [2019-12-18 17:27:06,552 INFO L226 Difference]: Without dead ends: 15958 [2019-12-18 17:27:06,552 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:27:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-18 17:27:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15958. [2019-12-18 17:27:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-18 17:27:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-18 17:27:06,835 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 33 [2019-12-18 17:27:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:06,835 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-18 17:27:06,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-18 17:27:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:06,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:06,844 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] [2019-12-18 17:27:06,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-18 17:27:06,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:06,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990805751] [2019-12-18 17:27:06,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:06,918 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:27:06,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990805751] [2019-12-18 17:27:06,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:06,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:06,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091209454] [2019-12-18 17:27:06,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:06,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:06,923 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 5 states. [2019-12-18 17:27:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:06,968 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-18 17:27:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:06,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 17:27:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:06,972 INFO L225 Difference]: With dead ends: 2712 [2019-12-18 17:27:06,972 INFO L226 Difference]: Without dead ends: 2403 [2019-12-18 17:27:06,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-18 17:27:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-18 17:27:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-18 17:27:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-18 17:27:07,011 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-18 17:27:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:07,014 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-18 17:27:07,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-18 17:27:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 17:27:07,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:07,019 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] [2019-12-18 17:27:07,020 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-18 17:27:07,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:07,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687760001] [2019-12-18 17:27:07,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:07,177 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:27:07,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687760001] [2019-12-18 17:27:07,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:07,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:07,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397809440] [2019-12-18 17:27:07,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:07,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:07,182 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 6 states. [2019-12-18 17:27:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:07,248 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-18 17:27:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:07,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 17:27:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:07,249 INFO L225 Difference]: With dead ends: 708 [2019-12-18 17:27:07,250 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 17:27:07,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 17:27:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-18 17:27:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 17:27:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-18 17:27:07,258 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-18 17:27:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:07,260 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-18 17:27:07,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-18 17:27:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:27:07,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:07,262 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] [2019-12-18 17:27:07,262 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-18 17:27:07,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:07,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872419675] [2019-12-18 17:27:07,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:07,414 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:27:07,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872419675] [2019-12-18 17:27:07,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:07,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:07,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641452589] [2019-12-18 17:27:07,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:07,417 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-18 17:27:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:07,618 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-18 17:27:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:07,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 17:27:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:07,620 INFO L225 Difference]: With dead ends: 877 [2019-12-18 17:27:07,620 INFO L226 Difference]: Without dead ends: 877 [2019-12-18 17:27:07,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-18 17:27:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-18 17:27:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 17:27:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-18 17:27:07,631 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-18 17:27:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:07,632 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-18 17:27:07,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-18 17:27:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:27:07,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:07,633 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] [2019-12-18 17:27:07,633 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-18 17:27:07,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:07,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400034097] [2019-12-18 17:27:07,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:07,745 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:27:07,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400034097] [2019-12-18 17:27:07,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:07,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:07,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657867476] [2019-12-18 17:27:07,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:07,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:07,747 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-18 17:27:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:07,763 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-18 17:27:07,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:07,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:27:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:07,765 INFO L225 Difference]: With dead ends: 642 [2019-12-18 17:27:07,765 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 17:27:07,765 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:27:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 17:27:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-18 17:27:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 17:27:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-18 17:27:07,774 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-18 17:27:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:07,774 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-18 17:27:07,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-18 17:27:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:07,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:07,776 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] [2019-12-18 17:27:07,776 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 17:27:07,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:07,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983615924] [2019-12-18 17:27:07,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:07,936 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:27:07,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983615924] [2019-12-18 17:27:07,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:07,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:27:07,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195788254] [2019-12-18 17:27:07,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:07,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:07,939 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 7 states. [2019-12-18 17:27:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:08,061 INFO L93 Difference]: Finished difference Result 960 states and 2014 transitions. [2019-12-18 17:27:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:27:08,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:27:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:08,063 INFO L225 Difference]: With dead ends: 960 [2019-12-18 17:27:08,063 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 17:27:08,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:27:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 17:27:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-18 17:27:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-18 17:27:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-18 17:27:08,071 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-18 17:27:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:08,071 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-18 17:27:08,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-18 17:27:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:08,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:08,073 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] [2019-12-18 17:27:08,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 17:27:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:08,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943065607] [2019-12-18 17:27:08,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:08,470 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:27:08,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943065607] [2019-12-18 17:27:08,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:08,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:27:08,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249302612] [2019-12-18 17:27:08,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:27:08,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:27:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:27:08,473 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 14 states. [2019-12-18 17:27:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,012 INFO L93 Difference]: Finished difference Result 865 states and 1881 transitions. [2019-12-18 17:27:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:27:09,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 17:27:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,014 INFO L225 Difference]: With dead ends: 865 [2019-12-18 17:27:09,014 INFO L226 Difference]: Without dead ends: 835 [2019-12-18 17:27:09,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:27:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-18 17:27:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 748. [2019-12-18 17:27:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 17:27:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-18 17:27:09,026 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-18 17:27:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-18 17:27:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:27:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-18 17:27:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:09,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,028 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] [2019-12-18 17:27:09,028 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-18 17:27:09,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864617151] [2019-12-18 17:27:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:09,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:27:09,174 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:27:09,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_123, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:27:09,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-18 17:27:09,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:27:09,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= 1 ~y$r_buff0_thd3~0_Out2008309254) (= 1 ~z~0_Out2008309254) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2008309254 0)) (= ~y$r_buff1_thd2~0_Out2008309254 ~y$r_buff0_thd2~0_In2008309254) (= ~__unbuffered_p2_EAX~0_Out2008309254 ~z~0_Out2008309254) (= ~y$r_buff0_thd1~0_In2008309254 ~y$r_buff1_thd1~0_Out2008309254) (= ~__unbuffered_p2_EBX~0_Out2008309254 ~a~0_In2008309254) (= ~y$r_buff0_thd3~0_In2008309254 ~y$r_buff1_thd3~0_Out2008309254) (= ~y$r_buff1_thd0~0_Out2008309254 ~y$r_buff0_thd0~0_In2008309254)) InVars {~a~0=~a~0_In2008309254, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2008309254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2008309254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2008309254, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2008309254, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2008309254} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out2008309254, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2008309254, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2008309254, ~a~0=~a~0_In2008309254, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2008309254, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out2008309254, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2008309254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2008309254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2008309254, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2008309254, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out2008309254, ~z~0=~z~0_Out2008309254, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2008309254} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:27:09,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:27:09,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1808713976 256))) (.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out1808713976| |P1Thread1of1ForFork0_#t~ite3_Out1808713976|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1808713976 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out1808713976| ~y~0_In1808713976)) (and (not .cse2) .cse0 (= ~y$w_buff1~0_In1808713976 |P1Thread1of1ForFork0_#t~ite3_Out1808713976|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1808713976, ~y$w_buff1~0=~y$w_buff1~0_In1808713976, ~y~0=~y~0_In1808713976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1808713976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1808713976, ~y$w_buff1~0=~y$w_buff1~0_In1808713976, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1808713976|, ~y~0=~y~0_In1808713976, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1808713976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1808713976} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:27:09,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1203628243 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1203628243 256) 0))) (or (and (= ~y$w_buff0_used~0_In1203628243 |P2Thread1of1ForFork1_#t~ite11_Out1203628243|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out1203628243| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1203628243, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1203628243} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1203628243, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1203628243|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1203628243} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:27:09,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-303932722 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-303932722 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-303932722 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-303932722 256)))) (or (and (= ~y$w_buff1_used~0_In-303932722 |P2Thread1of1ForFork1_#t~ite12_Out-303932722|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-303932722|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-303932722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-303932722, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-303932722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-303932722} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-303932722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-303932722, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-303932722, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-303932722|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-303932722} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:27:09,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In961814933 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In961814933 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out961814933) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In961814933 ~y$r_buff0_thd3~0_Out961814933)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In961814933, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In961814933} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out961814933|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In961814933, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out961814933} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:27:09,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In641270912 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In641270912 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In641270912 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In641270912 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out641270912| ~y$r_buff1_thd3~0_In641270912) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite14_Out641270912| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In641270912, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641270912, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In641270912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641270912} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out641270912|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In641270912, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641270912, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In641270912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641270912} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:27:09,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 17:27:09,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In328642797 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In328642797 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out328642797| ~y$w_buff0_used~0_In328642797)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out328642797| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In328642797, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In328642797} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In328642797, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In328642797, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out328642797|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:27:09,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1806167737 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1806167737 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1806167737 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1806167737 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out1806167737| 0)) (and (= |P1Thread1of1ForFork0_#t~ite6_Out1806167737| ~y$w_buff1_used~0_In1806167737) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1806167737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1806167737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1806167737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806167737} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1806167737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1806167737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1806167737, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1806167737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806167737} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:27:09,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1252428457 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1252428457 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1252428457 |P1Thread1of1ForFork0_#t~ite7_Out-1252428457|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-1252428457|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1252428457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1252428457} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1252428457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1252428457, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1252428457|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:27:09,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1024514525 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1024514525 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1024514525 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1024514525 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out1024514525|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1024514525 |P1Thread1of1ForFork0_#t~ite8_Out1024514525|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1024514525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1024514525, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1024514525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1024514525} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1024514525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1024514525, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1024514525, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1024514525|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1024514525} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:27:09,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:27:09,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:27:09,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite18_Out1720222895| |ULTIMATE.start_main_#t~ite19_Out1720222895|)) (.cse0 (= (mod ~y$w_buff1_used~0_In1720222895 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1720222895 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In1720222895 |ULTIMATE.start_main_#t~ite18_Out1720222895|)) (and .cse1 (= |ULTIMATE.start_main_#t~ite18_Out1720222895| ~y~0_In1720222895) (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1720222895, ~y~0=~y~0_In1720222895, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1720222895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1720222895} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1720222895, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1720222895|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1720222895|, ~y~0=~y~0_In1720222895, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1720222895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1720222895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:27:09,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-420190028 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-420190028 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-420190028|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-420190028| ~y$w_buff0_used~0_In-420190028)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-420190028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-420190028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-420190028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-420190028, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-420190028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:27:09,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1070323983 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1070323983 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1070323983 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1070323983 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1070323983| 0)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1070323983 |ULTIMATE.start_main_#t~ite21_Out-1070323983|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1070323983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1070323983, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1070323983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1070323983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1070323983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1070323983, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1070323983|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1070323983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1070323983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:27:09,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In948073665 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In948073665 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out948073665| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out948073665| ~y$r_buff0_thd0~0_In948073665)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In948073665, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In948073665} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In948073665, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In948073665, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out948073665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:27:09,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1214965901 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1214965901 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1214965901 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1214965901 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1214965901 |ULTIMATE.start_main_#t~ite23_Out-1214965901|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1214965901|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1214965901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1214965901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1214965901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1214965901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1214965901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1214965901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1214965901, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1214965901|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1214965901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:27:09,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1849913078 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-1849913078| |ULTIMATE.start_main_#t~ite29_Out-1849913078|) (= |ULTIMATE.start_main_#t~ite30_Out-1849913078| ~y$w_buff0~0_In-1849913078)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1849913078 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In-1849913078 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1849913078 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1849913078 256) 0))) (= ~y$w_buff0~0_In-1849913078 |ULTIMATE.start_main_#t~ite29_Out-1849913078|) (= |ULTIMATE.start_main_#t~ite30_Out-1849913078| |ULTIMATE.start_main_#t~ite29_Out-1849913078|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849913078, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1849913078|, ~y$w_buff0~0=~y$w_buff0~0_In-1849913078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849913078, ~weak$$choice2~0=~weak$$choice2~0_In-1849913078, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1849913078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1849913078} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1849913078|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849913078, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1849913078|, ~y$w_buff0~0=~y$w_buff0~0_In-1849913078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849913078, ~weak$$choice2~0=~weak$$choice2~0_In-1849913078, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1849913078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1849913078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:27:09,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2130985544 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2130985544 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2130985544 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2130985544 256))) (and (= (mod ~y$r_buff1_thd0~0_In-2130985544 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite36_Out-2130985544| |ULTIMATE.start_main_#t~ite35_Out-2130985544|) (= |ULTIMATE.start_main_#t~ite35_Out-2130985544| ~y$w_buff0_used~0_In-2130985544) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_In-2130985544| |ULTIMATE.start_main_#t~ite35_Out-2130985544|) (= |ULTIMATE.start_main_#t~ite36_Out-2130985544| ~y$w_buff0_used~0_In-2130985544)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130985544, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2130985544, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-2130985544|, ~weak$$choice2~0=~weak$$choice2~0_In-2130985544, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2130985544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130985544} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130985544, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2130985544, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2130985544|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2130985544|, ~weak$$choice2~0=~weak$$choice2~0_In-2130985544, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2130985544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130985544} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:27:09,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-59072605 256) 0))) (or (and (= ~y$w_buff1_used~0_In-59072605 |ULTIMATE.start_main_#t~ite38_Out-59072605|) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-59072605| |ULTIMATE.start_main_#t~ite38_Out-59072605|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-59072605 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-59072605 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-59072605 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-59072605 256) 0) .cse1)))) (and (= ~y$w_buff1_used~0_In-59072605 |ULTIMATE.start_main_#t~ite39_Out-59072605|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-59072605| |ULTIMATE.start_main_#t~ite38_Out-59072605|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-59072605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-59072605, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-59072605|, ~weak$$choice2~0=~weak$$choice2~0_In-59072605, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-59072605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-59072605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-59072605, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-59072605|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-59072605, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-59072605|, ~weak$$choice2~0=~weak$$choice2~0_In-59072605, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-59072605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-59072605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:27:09,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:27:09,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2056829570 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_In2056829570| |ULTIMATE.start_main_#t~ite44_Out2056829570|) (= |ULTIMATE.start_main_#t~ite45_Out2056829570| ~y$r_buff1_thd0~0_In2056829570) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2056829570 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2056829570 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2056829570 256))) (= (mod ~y$w_buff0_used~0_In2056829570 256) 0))) (= ~y$r_buff1_thd0~0_In2056829570 |ULTIMATE.start_main_#t~ite44_Out2056829570|) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out2056829570| |ULTIMATE.start_main_#t~ite44_Out2056829570|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2056829570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2056829570, ~weak$$choice2~0=~weak$$choice2~0_In2056829570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2056829570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2056829570, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In2056829570|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2056829570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2056829570, ~weak$$choice2~0=~weak$$choice2~0_In2056829570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2056829570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2056829570|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2056829570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2056829570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:27:09,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:27:09,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] 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:27:09,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:27:09 BasicIcfg [2019-12-18 17:27:09,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:27:09,280 INFO L168 Benchmark]: Toolchain (without parser) took 28046.21 ms. Allocated memory was 146.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 839.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,280 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.46 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,282 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,283 INFO L168 Benchmark]: RCFGBuilder took 871.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 104.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,284 INFO L168 Benchmark]: TraceAbstraction took 26272.17 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 784.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:09,293 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.75 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.46 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 104.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26272.17 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 784.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1770 SDtfs, 1940 SDslu, 3743 SDs, 0 SdLazy, 1942 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31188occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 36026 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 75629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...