/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:07:50,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:07:50,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:07:50,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:07:50,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:07:50,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:07:50,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:07:50,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:07:50,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:07:50,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:07:50,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:07:50,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:07:50,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:07:50,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:07:50,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:07:50,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:07:50,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:07:50,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:07:50,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:07:50,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:07:50,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:07:50,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:07:50,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:07:50,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:07:50,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:07:50,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:07:50,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:07:50,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:07:50,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:07:50,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:07:50,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:07:50,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:07:50,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:07:50,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:07:50,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:07:50,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:07:50,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:07:50,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:07:50,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:07:50,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:07:50,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:07:50,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:07:50,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:07:50,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:07:50,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:07:50,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:07:50,074 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:07:50,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:07:50,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:07:50,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:07:50,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:07:50,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:07:50,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:07:50,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:07:50,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:07:50,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:07:50,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:07:50,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:07:50,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:07:50,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:07:50,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:07:50,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:07:50,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:07:50,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:07:50,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:07:50,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:07:50,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:07:50,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:07:50,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:07:50,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:07:50,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:07:50,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:07:50,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:07:50,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:07:50,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:07:50,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:07:50,401 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:07:50,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2019-12-27 08:07:50,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12ffe61f/772c04ada04a485ebc7a88bc30e206f7/FLAG01db4985f [2019-12-27 08:07:51,020 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:07:51,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2019-12-27 08:07:51,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12ffe61f/772c04ada04a485ebc7a88bc30e206f7/FLAG01db4985f [2019-12-27 08:07:51,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12ffe61f/772c04ada04a485ebc7a88bc30e206f7 [2019-12-27 08:07:51,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:07:51,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:07:51,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:51,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:07:51,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:07:51,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:51" (1/1) ... [2019-12-27 08:07:51,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:51, skipping insertion in model container [2019-12-27 08:07:51,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:51" (1/1) ... [2019-12-27 08:07:51,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:07:51,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:07:52,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:52,040 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:07:52,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:52,253 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:07:52,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52 WrapperNode [2019-12-27 08:07:52,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:52,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:52,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:07:52,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:07:52,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:52,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:07:52,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:07:52,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:07:52,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (1/1) ... [2019-12-27 08:07:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:07:52,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:07:52,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:07:52,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:07:52,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (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-27 08:07:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:07:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:07:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:07:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:07:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:07:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:07:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:07:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:07:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:07:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:07:52,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:07:52,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:07:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:07:52,516 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:07:53,224 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:07:53,224 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:07:53,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:53 BoogieIcfgContainer [2019-12-27 08:07:53,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:07:53,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:07:53,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:07:53,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:07:53,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:07:51" (1/3) ... [2019-12-27 08:07:53,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307fa3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:53, skipping insertion in model container [2019-12-27 08:07:53,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:52" (2/3) ... [2019-12-27 08:07:53,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307fa3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:53, skipping insertion in model container [2019-12-27 08:07:53,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:53" (3/3) ... [2019-12-27 08:07:53,236 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2019-12-27 08:07:53,247 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:07:53,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:07:53,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:07:53,257 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:07:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,337 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:53,383 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:07:53,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:07:53,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:07:53,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:07:53,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:07:53,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:07:53,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:07:53,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:07:53,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:07:53,421 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 08:07:53,423 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 08:07:53,522 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 08:07:53,522 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:53,539 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 08:07:53,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 08:07:53,626 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 08:07:53,626 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:53,635 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 08:07:53,658 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 08:07:53,659 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:07:56,852 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 08:07:56,980 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 08:07:57,013 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93606 [2019-12-27 08:07:57,014 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-27 08:07:57,017 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-27 08:08:17,394 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126872 states. [2019-12-27 08:08:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 126872 states. [2019-12-27 08:08:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:08:17,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:17,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:08:17,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 835743, now seen corresponding path program 1 times [2019-12-27 08:08:17,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:17,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595274349] [2019-12-27 08:08:17,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:17,614 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-27 08:08:17,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595274349] [2019-12-27 08:08:17,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:17,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:08:17,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425473653] [2019-12-27 08:08:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:17,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:17,641 INFO L87 Difference]: Start difference. First operand 126872 states. Second operand 3 states. [2019-12-27 08:08:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:21,565 INFO L93 Difference]: Finished difference Result 126172 states and 544995 transitions. [2019-12-27 08:08:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:21,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:08:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:22,331 INFO L225 Difference]: With dead ends: 126172 [2019-12-27 08:08:22,332 INFO L226 Difference]: Without dead ends: 123624 [2019-12-27 08:08:22,335 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-27 08:08:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123624 states. [2019-12-27 08:08:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123624 to 123624. [2019-12-27 08:08:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123624 states. [2019-12-27 08:08:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123624 states to 123624 states and 534607 transitions. [2019-12-27 08:08:34,453 INFO L78 Accepts]: Start accepts. Automaton has 123624 states and 534607 transitions. Word has length 3 [2019-12-27 08:08:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:34,453 INFO L462 AbstractCegarLoop]: Abstraction has 123624 states and 534607 transitions. [2019-12-27 08:08:34,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 123624 states and 534607 transitions. [2019-12-27 08:08:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:08:34,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:34,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:34,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 358672898, now seen corresponding path program 1 times [2019-12-27 08:08:34,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:34,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734401850] [2019-12-27 08:08:34,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:34,575 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-27 08:08:34,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734401850] [2019-12-27 08:08:34,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:34,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:34,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358727372] [2019-12-27 08:08:34,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:34,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:34,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:34,579 INFO L87 Difference]: Start difference. First operand 123624 states and 534607 transitions. Second operand 4 states. [2019-12-27 08:08:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:40,390 INFO L93 Difference]: Finished difference Result 192934 states and 798071 transitions. [2019-12-27 08:08:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:40,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:08:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:41,185 INFO L225 Difference]: With dead ends: 192934 [2019-12-27 08:08:41,186 INFO L226 Difference]: Without dead ends: 192885 [2019-12-27 08:08:41,186 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-27 08:08:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192885 states. [2019-12-27 08:08:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192885 to 177949. [2019-12-27 08:08:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177949 states. [2019-12-27 08:08:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177949 states to 177949 states and 745039 transitions. [2019-12-27 08:08:59,212 INFO L78 Accepts]: Start accepts. Automaton has 177949 states and 745039 transitions. Word has length 11 [2019-12-27 08:08:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:59,212 INFO L462 AbstractCegarLoop]: Abstraction has 177949 states and 745039 transitions. [2019-12-27 08:08:59,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:08:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177949 states and 745039 transitions. [2019-12-27 08:08:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:59,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:59,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:59,220 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash -432185852, now seen corresponding path program 1 times [2019-12-27 08:08:59,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:59,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588725886] [2019-12-27 08:08:59,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:59,280 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-27 08:08:59,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588725886] [2019-12-27 08:08:59,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:59,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:59,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256612005] [2019-12-27 08:08:59,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:59,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:59,283 INFO L87 Difference]: Start difference. First operand 177949 states and 745039 transitions. Second operand 3 states. [2019-12-27 08:08:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:59,422 INFO L93 Difference]: Finished difference Result 35462 states and 116599 transitions. [2019-12-27 08:08:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:59,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 08:08:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:59,483 INFO L225 Difference]: With dead ends: 35462 [2019-12-27 08:08:59,483 INFO L226 Difference]: Without dead ends: 35462 [2019-12-27 08:08:59,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2019-12-27 08:09:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 35462. [2019-12-27 08:09:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35462 states. [2019-12-27 08:09:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35462 states to 35462 states and 116599 transitions. [2019-12-27 08:09:00,422 INFO L78 Accepts]: Start accepts. Automaton has 35462 states and 116599 transitions. Word has length 13 [2019-12-27 08:09:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:00,422 INFO L462 AbstractCegarLoop]: Abstraction has 35462 states and 116599 transitions. [2019-12-27 08:09:00,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35462 states and 116599 transitions. [2019-12-27 08:09:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:09:00,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:00,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:00,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash -796950478, now seen corresponding path program 1 times [2019-12-27 08:09:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:00,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134111968] [2019-12-27 08:09:00,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:00,604 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-27 08:09:00,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134111968] [2019-12-27 08:09:00,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:00,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:00,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045001375] [2019-12-27 08:09:00,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:09:00,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:09:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:09:00,612 INFO L87 Difference]: Start difference. First operand 35462 states and 116599 transitions. Second operand 4 states. [2019-12-27 08:09:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:01,210 INFO L93 Difference]: Finished difference Result 47114 states and 151311 transitions. [2019-12-27 08:09:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:09:01,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:09:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:01,298 INFO L225 Difference]: With dead ends: 47114 [2019-12-27 08:09:01,299 INFO L226 Difference]: Without dead ends: 47107 [2019-12-27 08:09:01,299 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-27 08:09:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47107 states. [2019-12-27 08:09:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47107 to 41593. [2019-12-27 08:09:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41593 states. [2019-12-27 08:09:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41593 states to 41593 states and 135840 transitions. [2019-12-27 08:09:03,605 INFO L78 Accepts]: Start accepts. Automaton has 41593 states and 135840 transitions. Word has length 13 [2019-12-27 08:09:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:03,605 INFO L462 AbstractCegarLoop]: Abstraction has 41593 states and 135840 transitions. [2019-12-27 08:09:03,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 41593 states and 135840 transitions. [2019-12-27 08:09:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:09:03,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:03,612 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-27 08:09:03,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1918798733, now seen corresponding path program 1 times [2019-12-27 08:09:03,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:03,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388993734] [2019-12-27 08:09:03,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:03,829 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-27 08:09:03,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388993734] [2019-12-27 08:09:03,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:03,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:03,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189638376] [2019-12-27 08:09:03,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:03,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:03,832 INFO L87 Difference]: Start difference. First operand 41593 states and 135840 transitions. Second operand 6 states. [2019-12-27 08:09:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:04,873 INFO L93 Difference]: Finished difference Result 56279 states and 178223 transitions. [2019-12-27 08:09:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:04,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 08:09:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:04,964 INFO L225 Difference]: With dead ends: 56279 [2019-12-27 08:09:04,964 INFO L226 Difference]: Without dead ends: 56272 [2019-12-27 08:09:04,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56272 states. [2019-12-27 08:09:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56272 to 41921. [2019-12-27 08:09:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41921 states. [2019-12-27 08:09:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41921 states to 41921 states and 136796 transitions. [2019-12-27 08:09:06,347 INFO L78 Accepts]: Start accepts. Automaton has 41921 states and 136796 transitions. Word has length 19 [2019-12-27 08:09:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:06,347 INFO L462 AbstractCegarLoop]: Abstraction has 41921 states and 136796 transitions. [2019-12-27 08:09:06,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41921 states and 136796 transitions. [2019-12-27 08:09:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:09:06,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:06,353 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-27 08:09:06,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash 92964301, now seen corresponding path program 2 times [2019-12-27 08:09:06,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:06,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261140914] [2019-12-27 08:09:06,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:06,420 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-27 08:09:06,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261140914] [2019-12-27 08:09:06,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:06,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:06,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291242761] [2019-12-27 08:09:06,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:06,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:06,422 INFO L87 Difference]: Start difference. First operand 41921 states and 136796 transitions. Second operand 5 states. [2019-12-27 08:09:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:07,224 INFO L93 Difference]: Finished difference Result 51994 states and 166207 transitions. [2019-12-27 08:09:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:09:07,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 08:09:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:07,317 INFO L225 Difference]: With dead ends: 51994 [2019-12-27 08:09:07,317 INFO L226 Difference]: Without dead ends: 51987 [2019-12-27 08:09:07,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:09:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51987 states. [2019-12-27 08:09:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51987 to 41907. [2019-12-27 08:09:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41907 states. [2019-12-27 08:09:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41907 states to 41907 states and 136705 transitions. [2019-12-27 08:09:08,672 INFO L78 Accepts]: Start accepts. Automaton has 41907 states and 136705 transitions. Word has length 19 [2019-12-27 08:09:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:08,673 INFO L462 AbstractCegarLoop]: Abstraction has 41907 states and 136705 transitions. [2019-12-27 08:09:08,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41907 states and 136705 transitions. [2019-12-27 08:09:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:09:08,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:08,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:08,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1840473137, now seen corresponding path program 1 times [2019-12-27 08:09:08,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:08,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916767090] [2019-12-27 08:09:08,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:08,740 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-27 08:09:08,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916767090] [2019-12-27 08:09:08,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:08,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:08,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952653893] [2019-12-27 08:09:08,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:09:08,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:09:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:09:08,742 INFO L87 Difference]: Start difference. First operand 41907 states and 136705 transitions. Second operand 4 states. [2019-12-27 08:09:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:08,782 INFO L93 Difference]: Finished difference Result 7558 states and 20694 transitions. [2019-12-27 08:09:08,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:09:08,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 08:09:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:08,793 INFO L225 Difference]: With dead ends: 7558 [2019-12-27 08:09:08,794 INFO L226 Difference]: Without dead ends: 7558 [2019-12-27 08:09:08,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:09:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-27 08:09:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7446. [2019-12-27 08:09:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7446 states. [2019-12-27 08:09:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 20374 transitions. [2019-12-27 08:09:08,907 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 20374 transitions. Word has length 25 [2019-12-27 08:09:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:08,907 INFO L462 AbstractCegarLoop]: Abstraction has 7446 states and 20374 transitions. [2019-12-27 08:09:08,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 20374 transitions. [2019-12-27 08:09:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:09:08,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:08,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:08,918 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1306882487, now seen corresponding path program 1 times [2019-12-27 08:09:08,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:08,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578430710] [2019-12-27 08:09:08,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:08,990 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-27 08:09:08,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578430710] [2019-12-27 08:09:08,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:08,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:08,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559877613] [2019-12-27 08:09:08,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:08,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:08,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:08,993 INFO L87 Difference]: Start difference. First operand 7446 states and 20374 transitions. Second operand 5 states. [2019-12-27 08:09:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:09,036 INFO L93 Difference]: Finished difference Result 5313 states and 15270 transitions. [2019-12-27 08:09:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:09:09,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 08:09:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:09,045 INFO L225 Difference]: With dead ends: 5313 [2019-12-27 08:09:09,046 INFO L226 Difference]: Without dead ends: 5313 [2019-12-27 08:09:09,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-27 08:09:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4949. [2019-12-27 08:09:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 08:09:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14286 transitions. [2019-12-27 08:09:09,146 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14286 transitions. Word has length 37 [2019-12-27 08:09:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:09,147 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14286 transitions. [2019-12-27 08:09:09,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14286 transitions. [2019-12-27 08:09:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:09:09,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:09,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 08:09:09,158 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1856109427, now seen corresponding path program 1 times [2019-12-27 08:09:09,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:09,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409181618] [2019-12-27 08:09:09,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:09,228 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-27 08:09:09,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409181618] [2019-12-27 08:09:09,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:09,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:09,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570934387] [2019-12-27 08:09:09,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:09,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:09,231 INFO L87 Difference]: Start difference. First operand 4949 states and 14286 transitions. Second operand 3 states. [2019-12-27 08:09:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:09,293 INFO L93 Difference]: Finished difference Result 4958 states and 14300 transitions. [2019-12-27 08:09:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:09,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 08:09:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:09,301 INFO L225 Difference]: With dead ends: 4958 [2019-12-27 08:09:09,301 INFO L226 Difference]: Without dead ends: 4958 [2019-12-27 08:09:09,301 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-27 08:09:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-27 08:09:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-27 08:09:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-27 08:09:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14296 transitions. [2019-12-27 08:09:09,372 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14296 transitions. Word has length 65 [2019-12-27 08:09:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:09,373 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14296 transitions. [2019-12-27 08:09:09,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14296 transitions. [2019-12-27 08:09:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:09:09,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:09,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:09,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -907011133, now seen corresponding path program 1 times [2019-12-27 08:09:09,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:09,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435953370] [2019-12-27 08:09:09,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:09,477 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-27 08:09:09,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435953370] [2019-12-27 08:09:09,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:09,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:09,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198680122] [2019-12-27 08:09:09,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:09,479 INFO L87 Difference]: Start difference. First operand 4954 states and 14296 transitions. Second operand 3 states. [2019-12-27 08:09:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:09,506 INFO L93 Difference]: Finished difference Result 4666 states and 13247 transitions. [2019-12-27 08:09:09,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:09,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 08:09:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:09,513 INFO L225 Difference]: With dead ends: 4666 [2019-12-27 08:09:09,514 INFO L226 Difference]: Without dead ends: 4666 [2019-12-27 08:09:09,514 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-27 08:09:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-27 08:09:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-27 08:09:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 08:09:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13247 transitions. [2019-12-27 08:09:09,575 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13247 transitions. Word has length 65 [2019-12-27 08:09:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:09,575 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13247 transitions. [2019-12-27 08:09:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13247 transitions. [2019-12-27 08:09:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:09:09,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:09,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:09,583 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1452404307, now seen corresponding path program 1 times [2019-12-27 08:09:09,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:09,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053313283] [2019-12-27 08:09:09,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:09,686 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-27 08:09:09,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053313283] [2019-12-27 08:09:09,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:09,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:09,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106711424] [2019-12-27 08:09:09,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:09,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:09,689 INFO L87 Difference]: Start difference. First operand 4666 states and 13247 transitions. Second operand 5 states. [2019-12-27 08:09:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:10,040 INFO L93 Difference]: Finished difference Result 6996 states and 19623 transitions. [2019-12-27 08:09:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:09:10,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 08:09:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:10,050 INFO L225 Difference]: With dead ends: 6996 [2019-12-27 08:09:10,051 INFO L226 Difference]: Without dead ends: 6996 [2019-12-27 08:09:10,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-12-27 08:09:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 4950. [2019-12-27 08:09:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 08:09:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14092 transitions. [2019-12-27 08:09:10,129 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14092 transitions. Word has length 66 [2019-12-27 08:09:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:10,129 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14092 transitions. [2019-12-27 08:09:10,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14092 transitions. [2019-12-27 08:09:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:09:10,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:10,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:10,136 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1528718795, now seen corresponding path program 2 times [2019-12-27 08:09:10,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:10,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678228334] [2019-12-27 08:09:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:10,222 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-27 08:09:10,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678228334] [2019-12-27 08:09:10,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037624653] [2019-12-27 08:09:10,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:10,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:10,224 INFO L87 Difference]: Start difference. First operand 4950 states and 14092 transitions. Second operand 5 states. [2019-12-27 08:09:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:10,545 INFO L93 Difference]: Finished difference Result 7482 states and 21136 transitions. [2019-12-27 08:09:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:09:10,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 08:09:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:10,558 INFO L225 Difference]: With dead ends: 7482 [2019-12-27 08:09:10,558 INFO L226 Difference]: Without dead ends: 7482 [2019-12-27 08:09:10,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2019-12-27 08:09:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6173. [2019-12-27 08:09:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-27 08:09:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17593 transitions. [2019-12-27 08:09:10,692 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17593 transitions. Word has length 66 [2019-12-27 08:09:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:10,693 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17593 transitions. [2019-12-27 08:09:10,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17593 transitions. [2019-12-27 08:09:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:09:10,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:10,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:10,707 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 899715013, now seen corresponding path program 3 times [2019-12-27 08:09:10,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:10,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665576295] [2019-12-27 08:09:10,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:10,877 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-27 08:09:10,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665576295] [2019-12-27 08:09:10,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:10,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:10,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131366491] [2019-12-27 08:09:10,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:10,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:10,879 INFO L87 Difference]: Start difference. First operand 6173 states and 17593 transitions. Second operand 3 states. [2019-12-27 08:09:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:11,269 INFO L93 Difference]: Finished difference Result 6173 states and 17592 transitions. [2019-12-27 08:09:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:11,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 08:09:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:11,278 INFO L225 Difference]: With dead ends: 6173 [2019-12-27 08:09:11,278 INFO L226 Difference]: Without dead ends: 6173 [2019-12-27 08:09:11,278 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-27 08:09:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2019-12-27 08:09:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 3985. [2019-12-27 08:09:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2019-12-27 08:09:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 11526 transitions. [2019-12-27 08:09:11,344 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 11526 transitions. Word has length 66 [2019-12-27 08:09:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 3985 states and 11526 transitions. [2019-12-27 08:09:11,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 11526 transitions. [2019-12-27 08:09:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:09:11,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:11,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:11,352 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 902960793, now seen corresponding path program 1 times [2019-12-27 08:09:11,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:11,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549017074] [2019-12-27 08:09:11,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:11,446 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-27 08:09:11,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549017074] [2019-12-27 08:09:11,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:11,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:11,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568262702] [2019-12-27 08:09:11,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:11,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:11,448 INFO L87 Difference]: Start difference. First operand 3985 states and 11526 transitions. Second operand 6 states. [2019-12-27 08:09:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:11,944 INFO L93 Difference]: Finished difference Result 6605 states and 18735 transitions. [2019-12-27 08:09:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:09:11,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 08:09:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:11,954 INFO L225 Difference]: With dead ends: 6605 [2019-12-27 08:09:11,954 INFO L226 Difference]: Without dead ends: 6605 [2019-12-27 08:09:11,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:09:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6605 states. [2019-12-27 08:09:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6605 to 3985. [2019-12-27 08:09:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2019-12-27 08:09:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 11526 transitions. [2019-12-27 08:09:12,025 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 11526 transitions. Word has length 67 [2019-12-27 08:09:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:12,025 INFO L462 AbstractCegarLoop]: Abstraction has 3985 states and 11526 transitions. [2019-12-27 08:09:12,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 11526 transitions. [2019-12-27 08:09:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:09:12,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:12,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:12,031 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1012218207, now seen corresponding path program 2 times [2019-12-27 08:09:12,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:12,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91432021] [2019-12-27 08:09:12,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:12,094 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-27 08:09:12,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91432021] [2019-12-27 08:09:12,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:12,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:12,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416398769] [2019-12-27 08:09:12,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:12,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:12,097 INFO L87 Difference]: Start difference. First operand 3985 states and 11526 transitions. Second operand 3 states. [2019-12-27 08:09:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:12,119 INFO L93 Difference]: Finished difference Result 3691 states and 10435 transitions. [2019-12-27 08:09:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:12,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 08:09:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:12,125 INFO L225 Difference]: With dead ends: 3691 [2019-12-27 08:09:12,126 INFO L226 Difference]: Without dead ends: 3691 [2019-12-27 08:09:12,126 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-27 08:09:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2019-12-27 08:09:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 2989. [2019-12-27 08:09:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 08:09:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8465 transitions. [2019-12-27 08:09:12,190 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8465 transitions. Word has length 67 [2019-12-27 08:09:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:12,190 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8465 transitions. [2019-12-27 08:09:12,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8465 transitions. [2019-12-27 08:09:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 08:09:12,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:12,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:12,197 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash -283246847, now seen corresponding path program 1 times [2019-12-27 08:09:12,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90984071] [2019-12-27 08:09:12,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:12,671 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-27 08:09:12,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90984071] [2019-12-27 08:09:12,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:12,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:09:12,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433150933] [2019-12-27 08:09:12,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:09:12,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:09:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:09:12,676 INFO L87 Difference]: Start difference. First operand 2989 states and 8465 transitions. Second operand 15 states. [2019-12-27 08:09:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:14,171 INFO L93 Difference]: Finished difference Result 8086 states and 22708 transitions. [2019-12-27 08:09:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:09:14,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 08:09:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:14,185 INFO L225 Difference]: With dead ends: 8086 [2019-12-27 08:09:14,185 INFO L226 Difference]: Without dead ends: 8054 [2019-12-27 08:09:14,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:09:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2019-12-27 08:09:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 4275. [2019-12-27 08:09:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-27 08:09:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 12013 transitions. [2019-12-27 08:09:14,265 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 12013 transitions. Word has length 68 [2019-12-27 08:09:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:14,265 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 12013 transitions. [2019-12-27 08:09:14,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:09:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 12013 transitions. [2019-12-27 08:09:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 08:09:14,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:14,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:14,271 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1594186905, now seen corresponding path program 2 times [2019-12-27 08:09:14,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:14,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015065515] [2019-12-27 08:09:14,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:09:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015065515] [2019-12-27 08:09:15,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:15,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 08:09:15,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700027049] [2019-12-27 08:09:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 08:09:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 08:09:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:09:15,270 INFO L87 Difference]: Start difference. First operand 4275 states and 12013 transitions. Second operand 23 states. [2019-12-27 08:09:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:20,401 INFO L93 Difference]: Finished difference Result 10720 states and 29770 transitions. [2019-12-27 08:09:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 08:09:20,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-27 08:09:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:20,418 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 08:09:20,418 INFO L226 Difference]: Without dead ends: 10688 [2019-12-27 08:09:20,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=525, Invalid=3635, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 08:09:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10688 states. [2019-12-27 08:09:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10688 to 4599. [2019-12-27 08:09:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-27 08:09:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 12955 transitions. [2019-12-27 08:09:20,514 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 12955 transitions. Word has length 68 [2019-12-27 08:09:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:20,514 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 12955 transitions. [2019-12-27 08:09:20,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 08:09:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 12955 transitions. [2019-12-27 08:09:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 08:09:20,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:20,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:20,521 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash -107188779, now seen corresponding path program 3 times [2019-12-27 08:09:20,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:20,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361139410] [2019-12-27 08:09:20,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:20,832 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-27 08:09:20,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361139410] [2019-12-27 08:09:20,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:20,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:09:20,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148005648] [2019-12-27 08:09:20,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:09:20,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:09:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:09:20,834 INFO L87 Difference]: Start difference. First operand 4599 states and 12955 transitions. Second operand 14 states. [2019-12-27 08:09:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:21,712 INFO L93 Difference]: Finished difference Result 8477 states and 24045 transitions. [2019-12-27 08:09:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 08:09:21,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 08:09:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:21,727 INFO L225 Difference]: With dead ends: 8477 [2019-12-27 08:09:21,727 INFO L226 Difference]: Without dead ends: 8445 [2019-12-27 08:09:21,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:09:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2019-12-27 08:09:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 4144. [2019-12-27 08:09:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-27 08:09:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11628 transitions. [2019-12-27 08:09:21,847 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11628 transitions. Word has length 68 [2019-12-27 08:09:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:21,847 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11628 transitions. [2019-12-27 08:09:21,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:09:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11628 transitions. [2019-12-27 08:09:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 08:09:21,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:21,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:21,855 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -812333303, now seen corresponding path program 4 times [2019-12-27 08:09:21,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:21,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805530607] [2019-12-27 08:09:21,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:21,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:09:21,972 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:09:21,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~z$w_buff0~0_31) (= v_~z$w_buff0_used~0_119 0) (= 0 v_~weak$$choice0~0_9) (= v_~main$tmp_guard0~0_7 0) (= v_~z$r_buff0_thd3~0_20 0) (= 0 v_~z$r_buff1_thd2~0_17) (= v_~x~0_13 0) (= v_~z$read_delayed~0_8 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~weak$$choice2~0_34) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2489~0.base_22|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2489~0.base_22|) (= 0 v_~z$flush_delayed~0_16) (= 0 v_~z$r_buff1_thd1~0_20) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$w_buff1_used~0_73) (< 0 |v_#StackHeapBarrier_14|) (= v_~z$r_buff0_thd1~0_27 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2489~0.base_22| 1) |v_#valid_54|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2489~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2489~0.base_22|) |v_ULTIMATE.start_main_~#t2489~0.offset_17| 0))) (= v_~main$tmp_guard1~0_14 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$mem_tmp~0_12 0) (= v_~z~0_30 0) (= 0 v_~z$w_buff1~0_27) (= v_~y~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~z$r_buff0_thd2~0_21 0) (= |v_ULTIMATE.start_main_~#t2489~0.offset_17| 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2489~0.base_22| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2489~0.offset=|v_ULTIMATE.start_main_~#t2489~0.offset_17|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_~#t2491~0.base=|v_ULTIMATE.start_main_~#t2491~0.base_19|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t2491~0.offset=|v_ULTIMATE.start_main_~#t2491~0.offset_14|, #length=|v_#length_21|, ULTIMATE.start_main_~#t2489~0.base=|v_ULTIMATE.start_main_~#t2489~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_~#t2490~0.base=|v_ULTIMATE.start_main_~#t2490~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t2490~0.offset=|v_ULTIMATE.start_main_~#t2490~0.offset_17|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_119, ~z$w_buff0~0=v_~z$w_buff0~0_31, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t2489~0.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t2491~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2491~0.offset, #length, ULTIMATE.start_main_~#t2489~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2490~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2490~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, 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, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 08:09:21,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_83 v_~z$w_buff1_used~0_48) (= 2 v_~z$w_buff0~0_17) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~z$w_buff1_used~0_48 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_82 1) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_15) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_83, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_48, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~z$w_buff1~0=v_~z$w_buff1~0_15, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 08:09:21,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1028307011 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1028307011 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1028307011 |P0Thread1of1ForFork0_#t~ite5_Out-1028307011|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1028307011|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1028307011, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1028307011} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1028307011|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1028307011, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1028307011} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 08:09:21,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2490~0.base_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2490~0.base_9|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2490~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2490~0.base_9|) |v_ULTIMATE.start_main_~#t2490~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2490~0.base_9| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2490~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t2490~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t2490~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2490~0.offset=|v_ULTIMATE.start_main_~#t2490~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2490~0.base=|v_ULTIMATE.start_main_~#t2490~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2490~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2490~0.base, #length] because there is no mapped edge [2019-12-27 08:09:21,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In830923972 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In830923972 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out830923972| ~z~0_In830923972) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In830923972 |P1Thread1of1ForFork1_#t~ite9_Out830923972|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In830923972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In830923972, ~z$w_buff1~0=~z$w_buff1~0_In830923972, ~z~0=~z~0_In830923972} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out830923972|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In830923972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In830923972, ~z$w_buff1~0=~z$w_buff1~0_In830923972, ~z~0=~z~0_In830923972} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 08:09:21,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2491~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2491~0.offset_11|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2491~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2491~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2491~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2491~0.base_13|) |v_ULTIMATE.start_main_~#t2491~0.offset_11| 2))) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2491~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2491~0.base=|v_ULTIMATE.start_main_~#t2491~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2491~0.offset=|v_ULTIMATE.start_main_~#t2491~0.offset_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2491~0.base, ULTIMATE.start_main_~#t2491~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 08:09:21,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 08:09:21,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-5919382 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-5919382 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-5919382|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-5919382 |P1Thread1of1ForFork1_#t~ite11_Out-5919382|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-5919382, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-5919382} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-5919382, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-5919382|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-5919382} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 08:09:21,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1483322371 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1483322371 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1483322371| ~z$w_buff1~0_In1483322371) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1483322371| ~z~0_In1483322371) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1483322371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483322371, ~z$w_buff1~0=~z$w_buff1~0_In1483322371, ~z~0=~z~0_In1483322371} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1483322371|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1483322371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483322371, ~z$w_buff1~0=~z$w_buff1~0_In1483322371, ~z~0=~z~0_In1483322371} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 08:09:21,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 08:09:21,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-383352851 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-383352851 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-383352851|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-383352851| ~z$w_buff0_used~0_In-383352851) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-383352851, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-383352851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-383352851, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-383352851, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-383352851|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 08:09:21,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1550541964 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1550541964 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1550541964 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1550541964 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1550541964| 0)) (and (= ~z$w_buff1_used~0_In-1550541964 |P2Thread1of1ForFork2_#t~ite18_Out-1550541964|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550541964, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1550541964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550541964, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1550541964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550541964, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1550541964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550541964, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1550541964, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1550541964|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 08:09:21,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In2133971366 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In2133971366 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2133971366 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2133971366 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2133971366 |P1Thread1of1ForFork1_#t~ite12_Out2133971366|)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out2133971366| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2133971366, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2133971366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133971366, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2133971366} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2133971366, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2133971366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133971366, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2133971366|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2133971366} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 08:09:21,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1109748733 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1109748733 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1109748733|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In1109748733 |P2Thread1of1ForFork2_#t~ite19_Out1109748733|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1109748733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1109748733} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1109748733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1109748733, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1109748733|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 08:09:21,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2025100040 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2025100040 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-2025100040| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-2025100040| ~z$r_buff0_thd2~0_In-2025100040) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2025100040, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2025100040} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2025100040, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2025100040|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2025100040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 08:09:21,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-219674717 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-219674717 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-219674717 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-219674717 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-219674717| ~z$r_buff1_thd2~0_In-219674717) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-219674717| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-219674717, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-219674717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219674717, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-219674717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-219674717, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-219674717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219674717, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-219674717|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-219674717} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:09:21,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 08:09:21,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In877549742 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In877549742 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In877549742 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In877549742 256)))) (or (and (= ~z$r_buff1_thd3~0_In877549742 |P2Thread1of1ForFork2_#t~ite20_Out877549742|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out877549742|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In877549742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In877549742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In877549742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In877549742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In877549742, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out877549742|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In877549742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In877549742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In877549742} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 08:09:21,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 08:09:21,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In826488740 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In826488740 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In826488740 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In826488740 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out826488740| ~z$w_buff1_used~0_In826488740) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out826488740| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In826488740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In826488740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In826488740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In826488740} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out826488740|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In826488740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In826488740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In826488740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In826488740} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 08:09:21,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-174411770 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-174411770 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-174411770 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-174411770 ~z$r_buff0_thd1~0_In-174411770)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-174411770, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-174411770} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-174411770, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-174411770|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-174411770} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 08:09:21,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2088133130 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2088133130 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-2088133130 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2088133130 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2088133130|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-2088133130 |P0Thread1of1ForFork0_#t~ite8_Out-2088133130|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2088133130, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2088133130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2088133130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2088133130} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2088133130, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2088133130|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2088133130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2088133130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2088133130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 08:09:21,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 08:09:21,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:09:21,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In652766261 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In652766261 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out652766261| |ULTIMATE.start_main_#t~ite24_Out652766261|))) (or (and (or .cse0 .cse1) (= ~z~0_In652766261 |ULTIMATE.start_main_#t~ite24_Out652766261|) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In652766261 |ULTIMATE.start_main_#t~ite24_Out652766261|) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In652766261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652766261, ~z$w_buff1~0=~z$w_buff1~0_In652766261, ~z~0=~z~0_In652766261} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In652766261, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out652766261|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652766261, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out652766261|, ~z$w_buff1~0=~z$w_buff1~0_In652766261, ~z~0=~z~0_In652766261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 08:09:21,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In842888172 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In842888172 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out842888172|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite26_Out842888172| ~z$w_buff0_used~0_In842888172)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In842888172, ~z$w_buff0_used~0=~z$w_buff0_used~0_In842888172} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In842888172, ~z$w_buff0_used~0=~z$w_buff0_used~0_In842888172, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out842888172|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 08:09:21,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1062351025 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1062351025 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1062351025 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1062351025 256)))) (or (and (= ~z$w_buff1_used~0_In-1062351025 |ULTIMATE.start_main_#t~ite27_Out-1062351025|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1062351025|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1062351025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1062351025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1062351025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1062351025} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1062351025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1062351025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1062351025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1062351025, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1062351025|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 08:09:21,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1234491302 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1234491302 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1234491302|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1234491302 |ULTIMATE.start_main_#t~ite28_Out-1234491302|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1234491302, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234491302} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1234491302, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1234491302|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234491302} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 08:09:21,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In39570216 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In39570216 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In39570216 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In39570216 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out39570216| 0)) (and (= |ULTIMATE.start_main_#t~ite29_Out39570216| ~z$r_buff1_thd0~0_In39570216) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In39570216, ~z$w_buff0_used~0=~z$w_buff0_used~0_In39570216, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In39570216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39570216} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In39570216, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out39570216|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In39570216, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In39570216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39570216} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 08:09:21,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~z$r_buff0_thd0~0_73 v_~z$r_buff0_thd0~0_72)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_72, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 08:09:21,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L832-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:09:21,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) 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_8, 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-27 08:09:22,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:09:22 BasicIcfg [2019-12-27 08:09:22,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:09:22,112 INFO L168 Benchmark]: Toolchain (without parser) took 90819.71 ms. Allocated memory was 142.6 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 98.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,113 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 957.99 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 153.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.64 ms. Allocated memory is still 200.3 MB. Free memory was 153.9 MB in the beginning and 150.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,115 INFO L168 Benchmark]: Boogie Preprocessor took 81.00 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,115 INFO L168 Benchmark]: RCFGBuilder took 772.09 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 98.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,116 INFO L168 Benchmark]: TraceAbstraction took 88882.83 ms. Allocated memory was 200.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:22,120 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 957.99 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 153.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.64 ms. Allocated memory is still 200.3 MB. Free memory was 153.9 MB in the beginning and 150.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.00 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.09 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 98.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88882.83 ms. Allocated memory was 200.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 173 ProgramPointsBefore, 97 ProgramPointsAfterwards, 210 TransitionsBefore, 110 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5431 VarBasedMoverChecksPositive, 176 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 93606 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L805] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L780] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L825] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L826] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L827] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3136 SDtfs, 3610 SDslu, 8282 SDs, 0 SdLazy, 7245 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 26 SyntacticMatches, 15 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177949occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 68395 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 241758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...