/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:32,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:32,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:32,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:32,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:32,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:32,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:32,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:32,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:32,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:32,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:32,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:32,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:32,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:32,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:32,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:32,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:32,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:32,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:32,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:32,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:32,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:32,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:32,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:32,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:32,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:32,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:32,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:32,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:32,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:32,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:32,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:32,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:32,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:32,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:32,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:33,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:33,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:33,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:33,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:33,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:33,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:31:33,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:33,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:33,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:33,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:33,031 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:33,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:33,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:33,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:33,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:33,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:33,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:33,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:33,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:33,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:33,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:33,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:33,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:33,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:33,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:33,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:33,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:33,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:33,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:33,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:33,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:33,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:33,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:33,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:33,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:33,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:33,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:33,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:33,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:33,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:33,323 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:33,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 13:31:33,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57f1fee/84aafc9efa714e01b4f5980b28c72af0/FLAG4bcaee440 [2019-12-18 13:31:33,918 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:33,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 13:31:33,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57f1fee/84aafc9efa714e01b4f5980b28c72af0/FLAG4bcaee440 [2019-12-18 13:31:34,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57f1fee/84aafc9efa714e01b4f5980b28c72af0 [2019-12-18 13:31:34,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:34,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:34,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:34,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:34,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:34,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:34" (1/1) ... [2019-12-18 13:31:34,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a341f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:34, skipping insertion in model container [2019-12-18 13:31:34,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:34" (1/1) ... [2019-12-18 13:31:34,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:34,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:34,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:34,945 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:35,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:35,099 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:35,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35 WrapperNode [2019-12-18 13:31:35,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:35,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:35,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:35,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:35,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:35,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:35,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:35,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:35,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (1/1) ... [2019-12-18 13:31:35,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:35,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:35,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:35,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:35,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (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 13:31:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:35,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:35,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:35,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:35,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:35,294 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 13:31:36,002 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:36,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:36,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:36 BoogieIcfgContainer [2019-12-18 13:31:36,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:36,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:36,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:36,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:36,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:34" (1/3) ... [2019-12-18 13:31:36,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a87ebb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:36, skipping insertion in model container [2019-12-18 13:31:36,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:35" (2/3) ... [2019-12-18 13:31:36,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a87ebb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:36, skipping insertion in model container [2019-12-18 13:31:36,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:36" (3/3) ... [2019-12-18 13:31:36,014 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-18 13:31:36,025 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:36,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:36,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:36,035 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:36,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,085 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,124 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:36,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:36,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:36,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:36,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:36,172 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:36,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:36,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:36,173 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:36,173 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:36,197 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 13:31:36,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:36,288 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:36,288 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:36,302 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 13:31:36,321 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:36,369 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:36,369 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:36,376 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 13:31:36,390 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 13:31:36,391 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:41,220 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:31:41,350 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:31:41,370 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 13:31:41,370 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 13:31:41,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 13:31:42,333 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 13:31:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 13:31:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:31:42,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:42,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:42,342 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 13:31:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 13:31:42,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:42,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42515854] [2019-12-18 13:31:42,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:42,641 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 13:31:42,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42515854] [2019-12-18 13:31:42,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:42,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107472344] [2019-12-18 13:31:42,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:42,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:42,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:42,666 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 13:31:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:42,986 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 13:31:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:42,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:31:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:43,131 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 13:31:43,132 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 13:31:43,133 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 13:31:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 13:31:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 13:31:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 13:31:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 13:31:43,971 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 13:31:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:43,972 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 13:31:43,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 13:31:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:31:43,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:43,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:43,987 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 13:31:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 13:31:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:43,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942490954] [2019-12-18 13:31:43,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:44,168 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 13:31:44,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942490954] [2019-12-18 13:31:44,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:44,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:44,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253577705] [2019-12-18 13:31:44,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:44,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:44,173 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 13:31:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:45,589 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 13:31:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:45,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:31:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:45,666 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 13:31:45,666 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 13:31:45,667 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 13:31:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 13:31:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 13:31:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 13:31:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 13:31:46,394 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 13:31:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:46,395 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 13:31:46,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 13:31:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:31:46,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:46,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:46,397 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 13:31:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 13:31:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:46,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505705605] [2019-12-18 13:31:46,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:46,454 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 13:31:46,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505705605] [2019-12-18 13:31:46,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:46,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:46,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212874881] [2019-12-18 13:31:46,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:46,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:46,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:46,457 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 13:31:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:46,863 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 13:31:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:46,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:31:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:46,961 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 13:31:46,961 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 13:31:46,962 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 13:31:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 13:31:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 13:31:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 13:31:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 13:31:47,909 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 13:31:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:47,910 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 13:31:47,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 13:31:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:31:47,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:47,917 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 13:31:47,918 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 13:31:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 13:31:47,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:47,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66394538] [2019-12-18 13:31:47,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:48,040 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 13:31:48,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66394538] [2019-12-18 13:31:48,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:48,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392171933] [2019-12-18 13:31:48,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:48,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:48,043 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 4 states. [2019-12-18 13:31:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:48,129 INFO L93 Difference]: Finished difference Result 13191 states and 41157 transitions. [2019-12-18 13:31:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:31:48,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 13:31:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:48,162 INFO L225 Difference]: With dead ends: 13191 [2019-12-18 13:31:48,162 INFO L226 Difference]: Without dead ends: 12661 [2019-12-18 13:31:48,163 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 13:31:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12661 states. [2019-12-18 13:31:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12661 to 12661. [2019-12-18 13:31:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-12-18 13:31:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 39651 transitions. [2019-12-18 13:31:48,700 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 39651 transitions. Word has length 19 [2019-12-18 13:31:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 12661 states and 39651 transitions. [2019-12-18 13:31:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 39651 transitions. [2019-12-18 13:31:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 13:31:48,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:48,710 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] [2019-12-18 13:31:48,710 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 13:31:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-18 13:31:48,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:48,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101321610] [2019-12-18 13:31:48,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:48,876 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 13:31:48,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101321610] [2019-12-18 13:31:48,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:48,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:48,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139540961] [2019-12-18 13:31:48,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:48,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:48,879 INFO L87 Difference]: Start difference. First operand 12661 states and 39651 transitions. Second operand 5 states. [2019-12-18 13:31:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:49,381 INFO L93 Difference]: Finished difference Result 16929 states and 51829 transitions. [2019-12-18 13:31:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:49,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 13:31:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:49,415 INFO L225 Difference]: With dead ends: 16929 [2019-12-18 13:31:49,415 INFO L226 Difference]: Without dead ends: 16922 [2019-12-18 13:31:49,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 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 13:31:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2019-12-18 13:31:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 12812. [2019-12-18 13:31:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-18 13:31:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-18 13:31:49,757 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 20 [2019-12-18 13:31:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:49,757 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-18 13:31:49,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-18 13:31:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:31:49,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:49,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:49,769 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 13:31:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-18 13:31:49,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:49,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050774585] [2019-12-18 13:31:49,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:49,850 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 13:31:49,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050774585] [2019-12-18 13:31:49,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:49,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:49,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494078504] [2019-12-18 13:31:49,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:49,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:49,854 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-18 13:31:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:50,332 INFO L93 Difference]: Finished difference Result 17980 states and 54854 transitions. [2019-12-18 13:31:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:50,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:31:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:50,363 INFO L225 Difference]: With dead ends: 17980 [2019-12-18 13:31:50,363 INFO L226 Difference]: Without dead ends: 17964 [2019-12-18 13:31:50,364 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 13:31:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17964 states. [2019-12-18 13:31:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17964 to 15695. [2019-12-18 13:31:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15695 states. [2019-12-18 13:31:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 48333 transitions. [2019-12-18 13:31:50,738 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 48333 transitions. Word has length 28 [2019-12-18 13:31:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:50,738 INFO L462 AbstractCegarLoop]: Abstraction has 15695 states and 48333 transitions. [2019-12-18 13:31:50,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 48333 transitions. [2019-12-18 13:31:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:31:50,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:50,758 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 13:31:50,758 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 13:31:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1223733812, now seen corresponding path program 1 times [2019-12-18 13:31:50,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:50,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287334691] [2019-12-18 13:31:50,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:50,803 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 13:31:50,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287334691] [2019-12-18 13:31:50,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:50,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:50,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763442296] [2019-12-18 13:31:50,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:50,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:50,809 INFO L87 Difference]: Start difference. First operand 15695 states and 48333 transitions. Second operand 3 states. [2019-12-18 13:31:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:50,919 INFO L93 Difference]: Finished difference Result 19865 states and 61636 transitions. [2019-12-18 13:31:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:50,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 13:31:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:50,946 INFO L225 Difference]: With dead ends: 19865 [2019-12-18 13:31:50,946 INFO L226 Difference]: Without dead ends: 19865 [2019-12-18 13:31:50,947 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 13:31:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19865 states. [2019-12-18 13:31:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19865 to 17509. [2019-12-18 13:31:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-18 13:31:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-18 13:31:51,495 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 34 [2019-12-18 13:31:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:51,496 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-18 13:31:51,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-18 13:31:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:31:51,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:51,516 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 13:31:51,516 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 13:31:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-18 13:31:51,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:51,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392325776] [2019-12-18 13:31:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:51,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392325776] [2019-12-18 13:31:51,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:51,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:51,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170747764] [2019-12-18 13:31:51,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:51,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:51,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:51,581 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 3 states. [2019-12-18 13:31:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:51,680 INFO L93 Difference]: Finished difference Result 17509 states and 54339 transitions. [2019-12-18 13:31:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:51,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 13:31:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:51,705 INFO L225 Difference]: With dead ends: 17509 [2019-12-18 13:31:51,705 INFO L226 Difference]: Without dead ends: 17509 [2019-12-18 13:31:51,705 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 13:31:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-18 13:31:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-18 13:31:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-18 13:31:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54339 transitions. [2019-12-18 13:31:51,982 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54339 transitions. Word has length 34 [2019-12-18 13:31:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:51,982 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54339 transitions. [2019-12-18 13:31:51,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54339 transitions. [2019-12-18 13:31:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:31:51,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:51,995 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 13:31:51,995 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 13:31:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1096312539, now seen corresponding path program 1 times [2019-12-18 13:31:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:51,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154572646] [2019-12-18 13:31:51,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:52,154 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 13:31:52,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154572646] [2019-12-18 13:31:52,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:52,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:31:52,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833126040] [2019-12-18 13:31:52,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:31:52,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:52,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:31:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:31:52,156 INFO L87 Difference]: Start difference. First operand 17509 states and 54339 transitions. Second operand 8 states. [2019-12-18 13:31:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:53,519 INFO L93 Difference]: Finished difference Result 25291 states and 76468 transitions. [2019-12-18 13:31:53,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 13:31:53,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:31:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:53,552 INFO L225 Difference]: With dead ends: 25291 [2019-12-18 13:31:53,552 INFO L226 Difference]: Without dead ends: 25263 [2019-12-18 13:31:53,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:31:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25263 states. [2019-12-18 13:31:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25263 to 17586. [2019-12-18 13:31:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17586 states. [2019-12-18 13:31:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17586 states to 17586 states and 54523 transitions. [2019-12-18 13:31:53,855 INFO L78 Accepts]: Start accepts. Automaton has 17586 states and 54523 transitions. Word has length 34 [2019-12-18 13:31:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 17586 states and 54523 transitions. [2019-12-18 13:31:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:31:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 17586 states and 54523 transitions. [2019-12-18 13:31:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:31:53,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:53,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:53,868 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 13:31:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-18 13:31:53,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:53,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441579700] [2019-12-18 13:31:53,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:53,943 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 13:31:53,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441579700] [2019-12-18 13:31:53,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:53,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352387429] [2019-12-18 13:31:53,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:53,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:53,945 INFO L87 Difference]: Start difference. First operand 17586 states and 54523 transitions. Second operand 5 states. [2019-12-18 13:31:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,002 INFO L93 Difference]: Finished difference Result 2986 states and 6892 transitions. [2019-12-18 13:31:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:54,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 13:31:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,006 INFO L225 Difference]: With dead ends: 2986 [2019-12-18 13:31:54,007 INFO L226 Difference]: Without dead ends: 2677 [2019-12-18 13:31:54,007 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 13:31:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2019-12-18 13:31:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2677. [2019-12-18 13:31:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2019-12-18 13:31:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 6031 transitions. [2019-12-18 13:31:54,043 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 6031 transitions. Word has length 34 [2019-12-18 13:31:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:54,043 INFO L462 AbstractCegarLoop]: Abstraction has 2677 states and 6031 transitions. [2019-12-18 13:31:54,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 6031 transitions. [2019-12-18 13:31:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 13:31:54,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:54,050 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 13:31:54,050 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 13:31:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-18 13:31:54,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:54,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215846888] [2019-12-18 13:31:54,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:54,173 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 13:31:54,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215846888] [2019-12-18 13:31:54,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:54,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:54,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626647036] [2019-12-18 13:31:54,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:54,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:54,176 INFO L87 Difference]: Start difference. First operand 2677 states and 6031 transitions. Second operand 6 states. [2019-12-18 13:31:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,234 INFO L93 Difference]: Finished difference Result 698 states and 1589 transitions. [2019-12-18 13:31:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:54,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 13:31:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,236 INFO L225 Difference]: With dead ends: 698 [2019-12-18 13:31:54,236 INFO L226 Difference]: Without dead ends: 652 [2019-12-18 13:31:54,236 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 13:31:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-18 13:31:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-18 13:31:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 13:31:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1367 transitions. [2019-12-18 13:31:54,244 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1367 transitions. Word has length 45 [2019-12-18 13:31:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:54,244 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1367 transitions. [2019-12-18 13:31:54,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1367 transitions. [2019-12-18 13:31:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:31:54,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:54,246 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 13:31:54,246 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 13:31:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-18 13:31:54,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:54,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920011383] [2019-12-18 13:31:54,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:54,326 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 13:31:54,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920011383] [2019-12-18 13:31:54,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:54,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:54,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327854104] [2019-12-18 13:31:54,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:54,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:54,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:54,329 INFO L87 Difference]: Start difference. First operand 596 states and 1367 transitions. Second operand 5 states. [2019-12-18 13:31:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,494 INFO L93 Difference]: Finished difference Result 867 states and 1996 transitions. [2019-12-18 13:31:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:54,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 13:31:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,495 INFO L225 Difference]: With dead ends: 867 [2019-12-18 13:31:54,495 INFO L226 Difference]: Without dead ends: 867 [2019-12-18 13:31:54,496 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 13:31:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-18 13:31:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 632. [2019-12-18 13:31:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-18 13:31:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1459 transitions. [2019-12-18 13:31:54,506 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1459 transitions. Word has length 56 [2019-12-18 13:31:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:54,506 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1459 transitions. [2019-12-18 13:31:54,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1459 transitions. [2019-12-18 13:31:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:31:54,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:54,508 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 13:31:54,508 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 13:31:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-18 13:31:54,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:54,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863541885] [2019-12-18 13:31:54,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:54,579 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 13:31:54,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863541885] [2019-12-18 13:31:54,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:54,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629156473] [2019-12-18 13:31:54,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:54,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:54,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:54,581 INFO L87 Difference]: Start difference. First operand 632 states and 1459 transitions. Second operand 3 states. [2019-12-18 13:31:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,593 INFO L93 Difference]: Finished difference Result 632 states and 1429 transitions. [2019-12-18 13:31:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:54,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:31:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,594 INFO L225 Difference]: With dead ends: 632 [2019-12-18 13:31:54,595 INFO L226 Difference]: Without dead ends: 632 [2019-12-18 13:31:54,595 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 13:31:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-18 13:31:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 596. [2019-12-18 13:31:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 13:31:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1343 transitions. [2019-12-18 13:31:54,605 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1343 transitions. Word has length 56 [2019-12-18 13:31:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:54,606 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1343 transitions. [2019-12-18 13:31:54,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1343 transitions. [2019-12-18 13:31:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:31:54,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:54,607 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 13:31:54,607 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 13:31:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:54,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 13:31:54,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:54,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189812247] [2019-12-18 13:31:54,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:54,801 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 13:31:54,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189812247] [2019-12-18 13:31:54,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:54,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:31:54,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762277033] [2019-12-18 13:31:54,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:31:54,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:31:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:54,804 INFO L87 Difference]: Start difference. First operand 596 states and 1343 transitions. Second operand 7 states. [2019-12-18 13:31:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,930 INFO L93 Difference]: Finished difference Result 940 states and 1992 transitions. [2019-12-18 13:31:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:31:54,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:31:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,932 INFO L225 Difference]: With dead ends: 940 [2019-12-18 13:31:54,932 INFO L226 Difference]: Without dead ends: 600 [2019-12-18 13:31:54,933 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 13:31:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-18 13:31:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2019-12-18 13:31:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-18 13:31:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1164 transitions. [2019-12-18 13:31:54,940 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1164 transitions. Word has length 57 [2019-12-18 13:31:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:54,940 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1164 transitions. [2019-12-18 13:31:54,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:31:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1164 transitions. [2019-12-18 13:31:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:31:54,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:54,942 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 13:31:54,942 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 13:31:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 13:31:54,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:54,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783722095] [2019-12-18 13:31:54,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:55,224 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 13:31:55,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783722095] [2019-12-18 13:31:55,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:55,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:31:55,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343846449] [2019-12-18 13:31:55,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:31:55,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:31:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:31:55,226 INFO L87 Difference]: Start difference. First operand 534 states and 1164 transitions. Second operand 12 states. [2019-12-18 13:31:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:55,643 INFO L93 Difference]: Finished difference Result 842 states and 1834 transitions. [2019-12-18 13:31:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:31:55,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:31:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:55,645 INFO L225 Difference]: With dead ends: 842 [2019-12-18 13:31:55,645 INFO L226 Difference]: Without dead ends: 812 [2019-12-18 13:31:55,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:31:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-12-18 13:31:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 738. [2019-12-18 13:31:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 13:31:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1617 transitions. [2019-12-18 13:31:55,662 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1617 transitions. Word has length 57 [2019-12-18 13:31:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:55,664 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1617 transitions. [2019-12-18 13:31:55,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:31:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1617 transitions. [2019-12-18 13:31:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:31:55,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:55,667 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 13:31:55,668 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 13:31:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-18 13:31:55,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:55,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511335390] [2019-12-18 13:31:55,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:55,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:31:55,868 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:31:55,872 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_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~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 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= 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_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= 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) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 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_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, 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, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__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_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, 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, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~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_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, 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|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, 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_#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_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, 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_~#t1114~0.offset, 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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__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_~#t1116~0.offset, 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, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, 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, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:31:55,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #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_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-18 13:31:55,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) 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_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:31:55,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff1_thd0~0_Out-1964733007 ~y$r_buff0_thd0~0_In-1964733007) (= ~__unbuffered_p2_EAX~0_Out-1964733007 ~z~0_Out-1964733007) (= 1 ~y$r_buff0_thd3~0_Out-1964733007) (= ~__unbuffered_p2_EBX~0_Out-1964733007 ~a~0_In-1964733007) (= ~y$r_buff0_thd1~0_In-1964733007 ~y$r_buff1_thd1~0_Out-1964733007) (= ~y$r_buff1_thd2~0_Out-1964733007 ~y$r_buff0_thd2~0_In-1964733007) (= 1 ~z~0_Out-1964733007) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1964733007 0)) (= ~y$r_buff1_thd3~0_Out-1964733007 ~y$r_buff0_thd3~0_In-1964733007)) InVars {~a~0=~a~0_In-1964733007, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1964733007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1964733007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1964733007, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1964733007, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1964733007} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1964733007, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1964733007, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1964733007, ~a~0=~a~0_In-1964733007, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1964733007, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1964733007, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1964733007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1964733007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1964733007, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1964733007, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1964733007, ~z~0=~z~0_Out-1964733007, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1964733007} 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 13:31:55,877 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 13:31:55,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In282178431 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out282178431| |P1Thread1of1ForFork0_#t~ite3_Out282178431|)) (.cse1 (= (mod ~y$w_buff1_used~0_In282178431 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out282178431| ~y~0_In282178431)) (and (not .cse0) .cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out282178431| ~y$w_buff1~0_In282178431) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282178431, ~y$w_buff1~0=~y$w_buff1~0_In282178431, ~y~0=~y~0_In282178431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282178431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In282178431, ~y$w_buff1~0=~y$w_buff1~0_In282178431, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out282178431|, ~y~0=~y~0_In282178431, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out282178431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282178431} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:31:55,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1346778406 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1346778406 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out-1346778406| ~y$w_buff0_used~0_In-1346778406) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out-1346778406| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1346778406, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1346778406} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1346778406, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1346778406|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1346778406} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:31:55,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-701996037 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-701996037 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-701996037 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-701996037 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-701996037 |P2Thread1of1ForFork1_#t~ite12_Out-701996037|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-701996037|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-701996037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-701996037, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-701996037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-701996037} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-701996037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-701996037, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-701996037, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-701996037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-701996037} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:31:55,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In626630349 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In626630349 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out626630349 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In626630349 ~y$r_buff0_thd3~0_Out626630349) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In626630349, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In626630349} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out626630349|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In626630349, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out626630349} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:31:55,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1906819752 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1906819752 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1906819752 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1906819752 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out1906819752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1906819752| ~y$r_buff1_thd3~0_In1906819752) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1906819752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1906819752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1906819752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1906819752} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1906819752|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1906819752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1906819752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1906819752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1906819752} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:31:55,882 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 13:31:55,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1029898344 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1029898344 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1029898344|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1029898344 |P1Thread1of1ForFork0_#t~ite5_Out1029898344|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1029898344, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1029898344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1029898344, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1029898344, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1029898344|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:31:55,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1196767240 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1196767240 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1196767240 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1196767240 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1196767240 |P1Thread1of1ForFork0_#t~ite6_Out1196767240|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out1196767240|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1196767240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196767240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196767240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196767240} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1196767240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196767240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196767240, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1196767240|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196767240} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:31:55,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1890021918 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1890021918 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1890021918 |P1Thread1of1ForFork0_#t~ite7_Out-1890021918|)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out-1890021918| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1890021918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890021918} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1890021918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890021918, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1890021918|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:31:55,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1690239668 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1690239668 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1690239668 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1690239668 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite8_Out-1690239668| ~y$r_buff1_thd2~0_In-1690239668)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-1690239668| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690239668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690239668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690239668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690239668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690239668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690239668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690239668, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1690239668|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690239668} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:31:55,885 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 13:31:55,885 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 13:31:55,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out1697697808| |ULTIMATE.start_main_#t~ite18_Out1697697808|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1697697808 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1697697808 256)))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In1697697808 |ULTIMATE.start_main_#t~ite18_Out1697697808|) (not .cse2)) (and .cse1 (= |ULTIMATE.start_main_#t~ite18_Out1697697808| ~y~0_In1697697808) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1697697808, ~y~0=~y~0_In1697697808, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1697697808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1697697808} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1697697808, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1697697808|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1697697808|, ~y~0=~y~0_In1697697808, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1697697808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1697697808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:31:55,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1806258546 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1806258546 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1806258546| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1806258546| ~y$w_buff0_used~0_In1806258546)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1806258546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806258546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1806258546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806258546, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1806258546|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:31:55,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In407913715 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In407913715 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In407913715 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In407913715 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out407913715|)) (and (= |ULTIMATE.start_main_#t~ite21_Out407913715| ~y$w_buff1_used~0_In407913715) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In407913715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In407913715, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In407913715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In407913715} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In407913715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In407913715, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out407913715|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In407913715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In407913715} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:31:55,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1033117348 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1033117348 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1033117348| ~y$r_buff0_thd0~0_In1033117348) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1033117348|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1033117348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033117348} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1033117348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033117348, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1033117348|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:31:55,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1042342659 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1042342659 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1042342659 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1042342659 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1042342659| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1042342659| ~y$r_buff1_thd0~0_In-1042342659) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1042342659, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1042342659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1042342659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1042342659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1042342659, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1042342659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1042342659, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1042342659|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1042342659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:31:55,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1512010885 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1512010885 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-1512010885 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1512010885 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1512010885 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite29_Out-1512010885| ~y$w_buff0~0_In-1512010885) (= |ULTIMATE.start_main_#t~ite29_Out-1512010885| |ULTIMATE.start_main_#t~ite30_Out-1512010885|) .cse1) (and (= |ULTIMATE.start_main_#t~ite30_Out-1512010885| ~y$w_buff0~0_In-1512010885) (= |ULTIMATE.start_main_#t~ite29_In-1512010885| |ULTIMATE.start_main_#t~ite29_Out-1512010885|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512010885, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1512010885|, ~y$w_buff0~0=~y$w_buff0~0_In-1512010885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1512010885, ~weak$$choice2~0=~weak$$choice2~0_In-1512010885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1512010885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512010885} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1512010885|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512010885, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1512010885|, ~y$w_buff0~0=~y$w_buff0~0_In-1512010885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1512010885, ~weak$$choice2~0=~weak$$choice2~0_In-1512010885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1512010885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512010885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:31:55,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-574939831 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_In-574939831| |ULTIMATE.start_main_#t~ite35_Out-574939831|) (= |ULTIMATE.start_main_#t~ite36_Out-574939831| ~y$w_buff0_used~0_In-574939831) (not .cse0)) (and (= ~y$w_buff0_used~0_In-574939831 |ULTIMATE.start_main_#t~ite35_Out-574939831|) (= |ULTIMATE.start_main_#t~ite36_Out-574939831| |ULTIMATE.start_main_#t~ite35_Out-574939831|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-574939831 256)))) (or (= (mod ~y$w_buff0_used~0_In-574939831 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-574939831 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-574939831 256)) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-574939831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-574939831, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-574939831|, ~weak$$choice2~0=~weak$$choice2~0_In-574939831, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-574939831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574939831} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-574939831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-574939831, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-574939831|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-574939831|, ~weak$$choice2~0=~weak$$choice2~0_In-574939831, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-574939831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574939831} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:31:55,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1885989219 256) 0))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In-1885989219 |ULTIMATE.start_main_#t~ite39_Out-1885989219|) (= |ULTIMATE.start_main_#t~ite38_In-1885989219| |ULTIMATE.start_main_#t~ite38_Out-1885989219|)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1885989219| ~y$w_buff1_used~0_In-1885989219) (= |ULTIMATE.start_main_#t~ite38_Out-1885989219| |ULTIMATE.start_main_#t~ite39_Out-1885989219|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1885989219 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1885989219 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1885989219 256)) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1885989219 256) 0) .cse1))) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885989219, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1885989219, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1885989219|, ~weak$$choice2~0=~weak$$choice2~0_In-1885989219, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1885989219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885989219} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885989219, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1885989219|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1885989219, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1885989219|, ~weak$$choice2~0=~weak$$choice2~0_In-1885989219, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1885989219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885989219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:31:55,894 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 13:31:55,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1353139760 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1353139760 |ULTIMATE.start_main_#t~ite44_Out-1353139760|) (= |ULTIMATE.start_main_#t~ite45_Out-1353139760| |ULTIMATE.start_main_#t~ite44_Out-1353139760|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1353139760 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1353139760 256))) (= (mod ~y$w_buff0_used~0_In-1353139760 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-1353139760 256) 0)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1353139760| ~y$r_buff1_thd0~0_In-1353139760) (= |ULTIMATE.start_main_#t~ite44_In-1353139760| |ULTIMATE.start_main_#t~ite44_Out-1353139760|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353139760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1353139760, ~weak$$choice2~0=~weak$$choice2~0_In-1353139760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1353139760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353139760, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1353139760|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353139760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1353139760, ~weak$$choice2~0=~weak$$choice2~0_In-1353139760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1353139760, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1353139760|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1353139760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353139760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:31:55,895 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 13:31:55,895 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 13:31:56,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:31:56 BasicIcfg [2019-12-18 13:31:56,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:31:56,020 INFO L168 Benchmark]: Toolchain (without parser) took 21768.46 ms. Allocated memory was 145.8 MB in the beginning and 1.0 GB in the end (delta: 869.3 MB). Free memory was 100.8 MB in the beginning and 628.7 MB in the end (delta: -528.0 MB). Peak memory consumption was 341.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,020 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.78 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.12 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,024 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,025 INFO L168 Benchmark]: RCFGBuilder took 786.11 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,029 INFO L168 Benchmark]: TraceAbstraction took 20010.65 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 811.1 MB). Free memory was 104.6 MB in the beginning and 628.7 MB in the end (delta: -524.1 MB). Peak memory consumption was 286.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:56,034 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.78 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.12 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.11 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20010.65 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 811.1 MB). Free memory was 104.6 MB in the beginning and 628.7 MB in the end (delta: -524.1 MB). Peak memory consumption was 286.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 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(&t1114, ((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(&t1115, ((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(&t1116, ((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: 19.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1775 SDtfs, 1952 SDslu, 3720 SDs, 0 SdLazy, 2204 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 21755 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 70386 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...