/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:13:42,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:13:42,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:13:42,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:13:42,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:13:42,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:13:42,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:13:42,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:13:42,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:13:42,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:13:42,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:13:42,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:13:42,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:13:42,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:13:42,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:13:42,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:13:42,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:13:42,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:13:42,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:13:42,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:13:42,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:13:42,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:13:42,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:13:42,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:13:42,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:13:42,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:13:42,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:13:42,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:13:42,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:13:42,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:13:42,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:13:42,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:13:42,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:13:42,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:13:42,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:13:42,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:13:42,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:13:42,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:13:42,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:13:42,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:13:42,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:13:42,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:13:42,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:13:42,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:13:42,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:13:42,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:13:42,442 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:13:42,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:13:42,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:13:42,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:13:42,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:13:42,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:13:42,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:13:42,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:13:42,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:13:42,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:13:42,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:13:42,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:13:42,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:13:42,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:13:42,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:13:42,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:13:42,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:13:42,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:13:42,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:13:42,447 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:13:42,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:13:42,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:13:42,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:13:42,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:13:42,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:13:42,776 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:13:42,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-18 13:13:42,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f9bf34/6c8e5a1e9a824e248dbfe8164b45e78f/FLAG9bc69cfe0 [2019-12-18 13:13:43,418 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:13:43,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-18 13:13:43,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f9bf34/6c8e5a1e9a824e248dbfe8164b45e78f/FLAG9bc69cfe0 [2019-12-18 13:13:43,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f9bf34/6c8e5a1e9a824e248dbfe8164b45e78f [2019-12-18 13:13:43,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:13:43,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:13:43,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:13:43,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:13:43,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:13:43,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:13:43" (1/1) ... [2019-12-18 13:13:43,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:43, skipping insertion in model container [2019-12-18 13:13:43,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:13:43" (1/1) ... [2019-12-18 13:13:43,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:13:43,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:13:44,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:13:44,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:13:44,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:13:44,567 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:13:44,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44 WrapperNode [2019-12-18 13:13:44,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:13:44,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:13:44,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:13:44,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:13:44,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:13:44,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:13:44,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:13:44,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:13:44,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... [2019-12-18 13:13:44,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:13:44,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:13:44,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:13:44,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:13:44,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:13:44,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:13:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:13:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:13:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:13:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:13:44,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:13:44,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:13:44,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:13:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:13:44,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:13:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:13:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:13:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:13:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:13:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:13:44,841 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:13:45,888 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:13:45,889 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:13:45,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:13:45 BoogieIcfgContainer [2019-12-18 13:13:45,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:13:45,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:13:45,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:13:45,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:13:45,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:13:43" (1/3) ... [2019-12-18 13:13:45,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77488bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:13:45, skipping insertion in model container [2019-12-18 13:13:45,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:13:44" (2/3) ... [2019-12-18 13:13:45,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77488bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:13:45, skipping insertion in model container [2019-12-18 13:13:45,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:13:45" (3/3) ... [2019-12-18 13:13:45,897 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.opt.i [2019-12-18 13:13:45,907 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:13:45,907 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:13:45,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:13:45,915 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:13:45,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,996 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,003 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:13:46,024 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:13:46,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:13:46,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:13:46,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:13:46,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:13:46,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:13:46,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:13:46,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:13:46,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:13:46,062 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-18 13:13:46,064 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-18 13:13:46,173 INFO L126 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-18 13:13:46,174 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:13:46,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 12/214 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-18 13:13:46,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-18 13:13:46,308 INFO L126 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-18 13:13:46,308 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:13:46,321 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 12/214 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-18 13:13:46,358 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-18 13:13:46,359 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:13:52,580 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:13:52,740 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:13:52,902 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-18 13:13:52,902 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-18 13:13:52,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-18 13:14:04,155 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-18 13:14:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-18 13:14:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:14:04,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:04,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:04,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-18 13:14:04,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:04,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169605199] [2019-12-18 13:14:04,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:04,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169605199] [2019-12-18 13:14:04,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:04,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:14:04,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146988663] [2019-12-18 13:14:04,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:04,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:04,504 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-18 13:14:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:07,649 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-18 13:14:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:07,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:14:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:08,598 INFO L225 Difference]: With dead ends: 105018 [2019-12-18 13:14:08,598 INFO L226 Difference]: Without dead ends: 102886 [2019-12-18 13:14:08,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-18 13:14:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-18 13:14:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-18 13:14:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-18 13:14:18,094 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-18 13:14:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:18,096 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-18 13:14:18,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-18 13:14:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:14:18,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:18,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:18,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-18 13:14:18,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:18,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059565920] [2019-12-18 13:14:18,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059565920] [2019-12-18 13:14:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:18,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:18,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214673396] [2019-12-18 13:14:18,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:18,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:18,208 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-18 13:14:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:23,648 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-18 13:14:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:14:23,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:14:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:24,425 INFO L225 Difference]: With dead ends: 165574 [2019-12-18 13:14:24,425 INFO L226 Difference]: Without dead ends: 165546 [2019-12-18 13:14:24,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-18 13:14:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-18 13:14:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-18 13:14:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-18 13:14:36,177 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-18 13:14:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:36,178 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-18 13:14:36,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-18 13:14:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:14:36,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:36,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:36,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-18 13:14:36,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:36,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342701651] [2019-12-18 13:14:36,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:36,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342701651] [2019-12-18 13:14:36,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223652363] [2019-12-18 13:14:36,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:36,249 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-18 13:14:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:41,677 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-18 13:14:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:41,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:14:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:41,996 INFO L225 Difference]: With dead ends: 124009 [2019-12-18 13:14:41,996 INFO L226 Difference]: Without dead ends: 124009 [2019-12-18 13:14:41,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-18 13:14:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-18 13:14:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-18 13:14:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-18 13:14:46,986 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-18 13:14:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:46,987 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-18 13:14:46,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-18 13:14:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:14:46,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:46,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:46,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-18 13:14:46,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:46,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94806635] [2019-12-18 13:14:46,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:47,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94806635] [2019-12-18 13:14:47,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:47,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:47,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526703972] [2019-12-18 13:14:47,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:47,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:47,060 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-18 13:14:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:47,263 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-18 13:14:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:14:47,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:14:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:47,353 INFO L225 Difference]: With dead ends: 48600 [2019-12-18 13:14:47,353 INFO L226 Difference]: Without dead ends: 48600 [2019-12-18 13:14:47,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-18 13:14:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-18 13:14:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-18 13:14:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-18 13:14:52,835 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-18 13:14:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:52,836 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-18 13:14:52,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-18 13:14:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:14:52,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:52,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:52,838 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-18 13:14:52,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:52,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536682824] [2019-12-18 13:14:52,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:52,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536682824] [2019-12-18 13:14:52,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:52,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:14:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900639475] [2019-12-18 13:14:52,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:14:52,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:14:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:52,915 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 5 states. [2019-12-18 13:14:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:53,011 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-18 13:14:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:14:53,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:14:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:53,026 INFO L225 Difference]: With dead ends: 6591 [2019-12-18 13:14:53,026 INFO L226 Difference]: Without dead ends: 6591 [2019-12-18 13:14:53,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-18 13:14:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-18 13:14:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-18 13:14:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-18 13:14:53,150 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-18 13:14:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:53,150 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-18 13:14:53,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:14:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-18 13:14:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:14:53,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:53,158 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] [2019-12-18 13:14:53,158 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-18 13:14:53,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:53,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145636535] [2019-12-18 13:14:53,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:53,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145636535] [2019-12-18 13:14:53,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:53,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:53,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559518029] [2019-12-18 13:14:53,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:14:53,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:14:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:53,256 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-18 13:14:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:53,320 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-18 13:14:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:14:53,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:14:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:53,329 INFO L225 Difference]: With dead ends: 3660 [2019-12-18 13:14:53,329 INFO L226 Difference]: Without dead ends: 3660 [2019-12-18 13:14:53,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-18 13:14:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-18 13:14:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-18 13:14:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-18 13:14:53,388 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-18 13:14:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:53,388 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-18 13:14:53,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:14:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-18 13:14:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:53,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:53,397 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:53,398 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-18 13:14:53,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:53,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948104519] [2019-12-18 13:14:53,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:53,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948104519] [2019-12-18 13:14:53,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:53,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:14:53,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047960919] [2019-12-18 13:14:53,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:14:53,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:14:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:53,599 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 6 states. [2019-12-18 13:14:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:54,210 INFO L93 Difference]: Finished difference Result 5233 states and 16394 transitions. [2019-12-18 13:14:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:14:54,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 13:14:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:54,222 INFO L225 Difference]: With dead ends: 5233 [2019-12-18 13:14:54,222 INFO L226 Difference]: Without dead ends: 5233 [2019-12-18 13:14:54,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:14:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-18 13:14:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 3820. [2019-12-18 13:14:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-18 13:14:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 12120 transitions. [2019-12-18 13:14:54,289 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 12120 transitions. Word has length 74 [2019-12-18 13:14:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:54,290 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 12120 transitions. [2019-12-18 13:14:54,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:14:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 12120 transitions. [2019-12-18 13:14:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:54,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:54,299 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:54,299 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-18 13:14:54,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:54,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738123947] [2019-12-18 13:14:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:54,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738123947] [2019-12-18 13:14:54,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:54,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:54,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074643533] [2019-12-18 13:14:54,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:14:54,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:54,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:14:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:54,437 INFO L87 Difference]: Start difference. First operand 3820 states and 12120 transitions. Second operand 5 states. [2019-12-18 13:14:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:54,687 INFO L93 Difference]: Finished difference Result 4381 states and 13710 transitions. [2019-12-18 13:14:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:14:54,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-18 13:14:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:54,695 INFO L225 Difference]: With dead ends: 4381 [2019-12-18 13:14:54,695 INFO L226 Difference]: Without dead ends: 4381 [2019-12-18 13:14:54,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2019-12-18 13:14:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4060. [2019-12-18 13:14:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-18 13:14:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 12832 transitions. [2019-12-18 13:14:54,771 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 12832 transitions. Word has length 74 [2019-12-18 13:14:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:54,772 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 12832 transitions. [2019-12-18 13:14:54,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:14:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 12832 transitions. [2019-12-18 13:14:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:54,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:54,784 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:54,784 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-18 13:14:54,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:54,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067831056] [2019-12-18 13:14:54,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:54,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067831056] [2019-12-18 13:14:54,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:54,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:14:54,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774474517] [2019-12-18 13:14:54,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:14:54,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:14:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:54,938 INFO L87 Difference]: Start difference. First operand 4060 states and 12832 transitions. Second operand 6 states. [2019-12-18 13:14:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:55,549 INFO L93 Difference]: Finished difference Result 5166 states and 16084 transitions. [2019-12-18 13:14:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:14:55,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 13:14:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:55,559 INFO L225 Difference]: With dead ends: 5166 [2019-12-18 13:14:55,559 INFO L226 Difference]: Without dead ends: 5166 [2019-12-18 13:14:55,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:14:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-12-18 13:14:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4424. [2019-12-18 13:14:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-12-18 13:14:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 13956 transitions. [2019-12-18 13:14:55,652 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 13956 transitions. Word has length 74 [2019-12-18 13:14:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:55,652 INFO L462 AbstractCegarLoop]: Abstraction has 4424 states and 13956 transitions. [2019-12-18 13:14:55,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:14:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 13956 transitions. [2019-12-18 13:14:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:55,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:55,662 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:55,662 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1912498904, now seen corresponding path program 4 times [2019-12-18 13:14:55,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:55,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885945369] [2019-12-18 13:14:55,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:55,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885945369] [2019-12-18 13:14:55,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:55,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:55,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656133013] [2019-12-18 13:14:55,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:55,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:55,774 INFO L87 Difference]: Start difference. First operand 4424 states and 13956 transitions. Second operand 4 states. [2019-12-18 13:14:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:55,832 INFO L93 Difference]: Finished difference Result 6545 states and 19573 transitions. [2019-12-18 13:14:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:14:55,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-18 13:14:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:55,837 INFO L225 Difference]: With dead ends: 6545 [2019-12-18 13:14:55,838 INFO L226 Difference]: Without dead ends: 2348 [2019-12-18 13:14:55,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-12-18 13:14:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2019-12-18 13:14:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-12-18 13:14:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 6216 transitions. [2019-12-18 13:14:55,880 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 6216 transitions. Word has length 74 [2019-12-18 13:14:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:55,881 INFO L462 AbstractCegarLoop]: Abstraction has 2348 states and 6216 transitions. [2019-12-18 13:14:55,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 6216 transitions. [2019-12-18 13:14:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:55,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:55,886 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:55,886 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1386364252, now seen corresponding path program 5 times [2019-12-18 13:14:55,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:55,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273627538] [2019-12-18 13:14:55,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:56,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273627538] [2019-12-18 13:14:56,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:56,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:56,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388293574] [2019-12-18 13:14:56,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:14:56,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:56,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:14:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:14:56,225 INFO L87 Difference]: Start difference. First operand 2348 states and 6216 transitions. Second operand 6 states. [2019-12-18 13:14:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:56,379 INFO L93 Difference]: Finished difference Result 4003 states and 9966 transitions. [2019-12-18 13:14:56,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:14:56,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 13:14:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:56,383 INFO L225 Difference]: With dead ends: 4003 [2019-12-18 13:14:56,383 INFO L226 Difference]: Without dead ends: 2022 [2019-12-18 13:14:56,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:14:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-12-18 13:14:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1517. [2019-12-18 13:14:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2019-12-18 13:14:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 3502 transitions. [2019-12-18 13:14:56,408 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 3502 transitions. Word has length 74 [2019-12-18 13:14:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:56,408 INFO L462 AbstractCegarLoop]: Abstraction has 1517 states and 3502 transitions. [2019-12-18 13:14:56,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:14:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 3502 transitions. [2019-12-18 13:14:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:56,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:56,412 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:56,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1120678440, now seen corresponding path program 6 times [2019-12-18 13:14:56,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:56,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229122278] [2019-12-18 13:14:56,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:56,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229122278] [2019-12-18 13:14:56,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:56,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:14:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959201736] [2019-12-18 13:14:56,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:14:56,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:14:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:14:56,525 INFO L87 Difference]: Start difference. First operand 1517 states and 3502 transitions. Second operand 7 states. [2019-12-18 13:14:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:57,252 INFO L93 Difference]: Finished difference Result 2970 states and 6835 transitions. [2019-12-18 13:14:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:14:57,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-18 13:14:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:57,257 INFO L225 Difference]: With dead ends: 2970 [2019-12-18 13:14:57,257 INFO L226 Difference]: Without dead ends: 2970 [2019-12-18 13:14:57,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:14:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2019-12-18 13:14:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1562. [2019-12-18 13:14:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2019-12-18 13:14:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 3616 transitions. [2019-12-18 13:14:57,278 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 3616 transitions. Word has length 74 [2019-12-18 13:14:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:57,278 INFO L462 AbstractCegarLoop]: Abstraction has 1562 states and 3616 transitions. [2019-12-18 13:14:57,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:14:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 3616 transitions. [2019-12-18 13:14:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:57,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:57,281 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, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:57,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1399189610, now seen corresponding path program 7 times [2019-12-18 13:14:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:57,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568595774] [2019-12-18 13:14:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:57,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568595774] [2019-12-18 13:14:57,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:57,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:14:57,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123240448] [2019-12-18 13:14:57,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:14:57,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:14:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:14:57,390 INFO L87 Difference]: Start difference. First operand 1562 states and 3616 transitions. Second operand 7 states. [2019-12-18 13:14:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:57,999 INFO L93 Difference]: Finished difference Result 2926 states and 6791 transitions. [2019-12-18 13:14:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:14:57,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-18 13:14:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,004 INFO L225 Difference]: With dead ends: 2926 [2019-12-18 13:14:58,004 INFO L226 Difference]: Without dead ends: 2926 [2019-12-18 13:14:58,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:14:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2019-12-18 13:14:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1556. [2019-12-18 13:14:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-12-18 13:14:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 3604 transitions. [2019-12-18 13:14:58,026 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 3604 transitions. Word has length 74 [2019-12-18 13:14:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,026 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 3604 transitions. [2019-12-18 13:14:58,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:14:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 3604 transitions. [2019-12-18 13:14:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:14:58,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,029 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1587651062, now seen corresponding path program 8 times [2019-12-18 13:14:58,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469121633] [2019-12-18 13:14:58,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469121633] [2019-12-18 13:14:58,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:58,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515520782] [2019-12-18 13:14:58,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:58,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:58,103 INFO L87 Difference]: Start difference. First operand 1556 states and 3604 transitions. Second operand 3 states. [2019-12-18 13:14:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,141 INFO L93 Difference]: Finished difference Result 1555 states and 3602 transitions. [2019-12-18 13:14:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:58,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-18 13:14:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,143 INFO L225 Difference]: With dead ends: 1555 [2019-12-18 13:14:58,143 INFO L226 Difference]: Without dead ends: 1555 [2019-12-18 13:14:58,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-12-18 13:14:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1197. [2019-12-18 13:14:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-12-18 13:14:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2778 transitions. [2019-12-18 13:14:58,161 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2778 transitions. Word has length 74 [2019-12-18 13:14:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,162 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 2778 transitions. [2019-12-18 13:14:58,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2778 transitions. [2019-12-18 13:14:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 13:14:58,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,165 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash -423476261, now seen corresponding path program 1 times [2019-12-18 13:14:58,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525362078] [2019-12-18 13:14:58,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525362078] [2019-12-18 13:14:58,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:58,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69031776] [2019-12-18 13:14:58,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:58,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:58,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:58,253 INFO L87 Difference]: Start difference. First operand 1197 states and 2778 transitions. Second operand 4 states. [2019-12-18 13:14:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,284 INFO L93 Difference]: Finished difference Result 1411 states and 3178 transitions. [2019-12-18 13:14:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:14:58,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-18 13:14:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,286 INFO L225 Difference]: With dead ends: 1411 [2019-12-18 13:14:58,286 INFO L226 Difference]: Without dead ends: 294 [2019-12-18 13:14:58,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-18 13:14:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-12-18 13:14:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-18 13:14:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 530 transitions. [2019-12-18 13:14:58,290 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 530 transitions. Word has length 75 [2019-12-18 13:14:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,291 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 530 transitions. [2019-12-18 13:14:58,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 530 transitions. [2019-12-18 13:14:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 13:14:58,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,292 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,292 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1429844161, now seen corresponding path program 2 times [2019-12-18 13:14:58,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324095839] [2019-12-18 13:14:58,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324095839] [2019-12-18 13:14:58,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:58,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389906329] [2019-12-18 13:14:58,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:14:58,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:14:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:14:58,429 INFO L87 Difference]: Start difference. First operand 294 states and 530 transitions. Second operand 7 states. [2019-12-18 13:14:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,546 INFO L93 Difference]: Finished difference Result 639 states and 1176 transitions. [2019-12-18 13:14:58,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:14:58,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-18 13:14:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,547 INFO L225 Difference]: With dead ends: 639 [2019-12-18 13:14:58,547 INFO L226 Difference]: Without dead ends: 358 [2019-12-18 13:14:58,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:14:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-18 13:14:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 294. [2019-12-18 13:14:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-18 13:14:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 529 transitions. [2019-12-18 13:14:58,550 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 529 transitions. Word has length 75 [2019-12-18 13:14:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,551 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 529 transitions. [2019-12-18 13:14:58,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:14:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 529 transitions. [2019-12-18 13:14:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-18 13:14:58,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,552 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,552 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1721238743, now seen corresponding path program 1 times [2019-12-18 13:14:58,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150599640] [2019-12-18 13:14:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150599640] [2019-12-18 13:14:58,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:58,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136776344] [2019-12-18 13:14:58,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:58,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:58,610 INFO L87 Difference]: Start difference. First operand 294 states and 529 transitions. Second operand 3 states. [2019-12-18 13:14:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,621 INFO L93 Difference]: Finished difference Result 284 states and 493 transitions. [2019-12-18 13:14:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:58,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-18 13:14:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,622 INFO L225 Difference]: With dead ends: 284 [2019-12-18 13:14:58,622 INFO L226 Difference]: Without dead ends: 284 [2019-12-18 13:14:58,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-18 13:14:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2019-12-18 13:14:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-18 13:14:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 425 transitions. [2019-12-18 13:14:58,626 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 425 transitions. Word has length 76 [2019-12-18 13:14:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,626 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 425 transitions. [2019-12-18 13:14:58,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 425 transitions. [2019-12-18 13:14:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 13:14:58,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,628 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 1 times [2019-12-18 13:14:58,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084917508] [2019-12-18 13:14:58,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:59,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084917508] [2019-12-18 13:14:59,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:59,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:14:59,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893856062] [2019-12-18 13:14:59,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:14:59,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:14:59,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:14:59,095 INFO L87 Difference]: Start difference. First operand 248 states and 425 transitions. Second operand 18 states. [2019-12-18 13:15:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:00,380 INFO L93 Difference]: Finished difference Result 820 states and 1418 transitions. [2019-12-18 13:15:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:15:00,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2019-12-18 13:15:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:00,381 INFO L225 Difference]: With dead ends: 820 [2019-12-18 13:15:00,381 INFO L226 Difference]: Without dead ends: 778 [2019-12-18 13:15:00,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:15:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-18 13:15:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 388. [2019-12-18 13:15:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-18 13:15:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 662 transitions. [2019-12-18 13:15:00,390 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 662 transitions. Word has length 77 [2019-12-18 13:15:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:00,390 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 662 transitions. [2019-12-18 13:15:00,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:15:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 662 transitions. [2019-12-18 13:15:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 13:15:00,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:00,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:00,391 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash 90839542, now seen corresponding path program 2 times [2019-12-18 13:15:00,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:00,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980394563] [2019-12-18 13:15:00,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:00,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980394563] [2019-12-18 13:15:00,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:00,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:15:00,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412347336] [2019-12-18 13:15:00,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:15:00,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:15:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:15:00,611 INFO L87 Difference]: Start difference. First operand 388 states and 662 transitions. Second operand 13 states. [2019-12-18 13:15:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:01,138 INFO L93 Difference]: Finished difference Result 567 states and 964 transitions. [2019-12-18 13:15:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:15:01,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-12-18 13:15:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:01,140 INFO L225 Difference]: With dead ends: 567 [2019-12-18 13:15:01,140 INFO L226 Difference]: Without dead ends: 538 [2019-12-18 13:15:01,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:15:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-18 13:15:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 372. [2019-12-18 13:15:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-18 13:15:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 633 transitions. [2019-12-18 13:15:01,145 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 633 transitions. Word has length 77 [2019-12-18 13:15:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 633 transitions. [2019-12-18 13:15:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:15:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 633 transitions. [2019-12-18 13:15:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 13:15:01,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:01,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:01,147 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:01,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 3 times [2019-12-18 13:15:01,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:01,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420887274] [2019-12-18 13:15:01,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:01,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:15:01,280 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:15:01,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t829~0.base_24| 4) |v_#length_29|) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24| 1)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t829~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 |v_ULTIMATE.start_main_~#t829~0.offset_19|) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24|) |v_ULTIMATE.start_main_~#t829~0.offset_19| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24|)) (= v_~z$r_buff1_thd2~0_205 0) (= v_~z$r_buff1_thd0~0_494 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_18|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_23|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t829~0.base=|v_ULTIMATE.start_main_~#t829~0.base_24|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_18|, ULTIMATE.start_main_~#t829~0.offset=|v_ULTIMATE.start_main_~#t829~0.offset_19|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t832~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_~#t831~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t829~0.base, ULTIMATE.start_main_~#t832~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t831~0.offset, ULTIMATE.start_main_~#t829~0.offset, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:15:01,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t830~0.offset_9| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t830~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t830~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t830~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10|) |v_ULTIMATE.start_main_~#t830~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_9|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:15:01,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= |v_ULTIMATE.start_main_~#t831~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t831~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t831~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12|) |v_ULTIMATE.start_main_~#t831~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t831~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t831~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t831~0.base] because there is no mapped edge [2019-12-18 13:15:01,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t832~0.base_13|) (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13| 1) |v_#valid_52|) (= |v_ULTIMATE.start_main_~#t832~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t832~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t832~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13|) |v_ULTIMATE.start_main_~#t832~0.offset_11| 3)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t832~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t832~0.offset, #length] because there is no mapped edge [2019-12-18 13:15:01,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-18 13:15:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork3_#t~ite12_Out-1162667517| |P3Thread1of1ForFork3_#t~ite11_Out-1162667517|)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1162667517 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1162667517 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1162667517| ~z$w_buff1~0_In-1162667517) .cse2) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1162667517| ~z$w_buff0~0_In-1162667517) .cse2 (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1162667517, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1162667517, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1162667517, ~z$w_buff1~0=~z$w_buff1~0_In-1162667517} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1162667517, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1162667517, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1162667517|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1162667517, ~z$w_buff1~0=~z$w_buff1~0_In-1162667517, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1162667517|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:15:01,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 13:15:01,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2036136860 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite31_Out-2036136860| ~z$mem_tmp~0_In-2036136860) (not .cse0)) (and (= ~z~0_In-2036136860 |P3Thread1of1ForFork3_#t~ite31_Out-2036136860|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2036136860, ~z$flush_delayed~0=~z$flush_delayed~0_In-2036136860, ~z~0=~z~0_In-2036136860} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2036136860, ~z$flush_delayed~0=~z$flush_delayed~0_In-2036136860, ~z~0=~z~0_In-2036136860, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out-2036136860|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 13:15:01,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:15:01,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:15:01,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite4_Out-1331464572| |P2Thread1of1ForFork2_#t~ite3_Out-1331464572|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1331464572 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1331464572 256) 0))) (or (and (= ~z$w_buff1~0_In-1331464572 |P2Thread1of1ForFork2_#t~ite3_Out-1331464572|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In-1331464572 |P2Thread1of1ForFork2_#t~ite3_Out-1331464572|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1331464572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1331464572, ~z$w_buff1~0=~z$w_buff1~0_In-1331464572, ~z~0=~z~0_In-1331464572} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out-1331464572|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1331464572|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1331464572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1331464572, ~z$w_buff1~0=~z$w_buff1~0_In-1331464572, ~z~0=~z~0_In-1331464572} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:15:01,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In768102965 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In768102965 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out768102965|)) (and (= ~z$w_buff0_used~0_In768102965 |P2Thread1of1ForFork2_#t~ite5_Out768102965|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In768102965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In768102965} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out768102965|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In768102965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In768102965} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:15:01,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In203420303 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In203420303 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In203420303 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In203420303 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out203420303| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out203420303| ~z$w_buff1_used~0_In203420303)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In203420303, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In203420303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203420303, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In203420303} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out203420303|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203420303, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In203420303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203420303, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In203420303} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:15:01,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-837271300 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-837271300 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-837271300| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-837271300| ~z$r_buff0_thd3~0_In-837271300)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-837271300, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-837271300} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-837271300, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-837271300, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-837271300|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:15:01,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1530002392 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1530002392 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1530002392 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1530002392 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1530002392| ~z$r_buff1_thd3~0_In-1530002392) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1530002392| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530002392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530002392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530002392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530002392} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530002392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530002392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530002392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530002392, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1530002392|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:15:01,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:15:01,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-900464200 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-900464200 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite34_Out-900464200|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-900464200 |P3Thread1of1ForFork3_#t~ite34_Out-900464200|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-900464200, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-900464200} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-900464200, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-900464200, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out-900464200|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-18 13:15:01,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In743979455 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In743979455 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In743979455 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In743979455 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite35_Out743979455|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In743979455 |P3Thread1of1ForFork3_#t~ite35_Out743979455|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In743979455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In743979455, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In743979455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In743979455} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In743979455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In743979455, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In743979455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In743979455, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out743979455|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-18 13:15:01,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In348801501 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In348801501 256)))) (or (and (= ~z$r_buff0_thd4~0_Out348801501 ~z$r_buff0_thd4~0_In348801501) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out348801501 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In348801501, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In348801501} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In348801501, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out348801501|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out348801501} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 13:15:01,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1863282050 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1863282050 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1863282050 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1863282050 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite37_Out1863282050| 0)) (and (= |P3Thread1of1ForFork3_#t~ite37_Out1863282050| ~z$r_buff1_thd4~0_In1863282050) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1863282050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863282050, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1863282050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863282050} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1863282050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863282050, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out1863282050|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1863282050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863282050} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-18 13:15:01,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:15:01,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:15:01,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1802416819 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1802416819 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1802416819 |ULTIMATE.start_main_#t~ite42_Out1802416819|)) (and (not .cse1) (= ~z$w_buff1~0_In1802416819 |ULTIMATE.start_main_#t~ite42_Out1802416819|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1802416819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1802416819, ~z$w_buff1~0=~z$w_buff1~0_In1802416819, ~z~0=~z~0_In1802416819} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1802416819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1802416819, ~z$w_buff1~0=~z$w_buff1~0_In1802416819, ~z~0=~z~0_In1802416819, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1802416819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:15:01,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:15:01,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-115329539 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-115329539 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-115329539|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-115329539| ~z$w_buff0_used~0_In-115329539)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115329539, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115329539} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115329539, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115329539, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-115329539|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:15:01,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1072417868 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1072417868 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1072417868 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1072417868 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1072417868| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1072417868| ~z$w_buff1_used~0_In-1072417868)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1072417868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1072417868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1072417868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1072417868} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1072417868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1072417868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1072417868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1072417868, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1072417868|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:15:01,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-964775222 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-964775222 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-964775222| ~z$r_buff0_thd0~0_In-964775222)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-964775222|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-964775222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-964775222} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-964775222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-964775222, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-964775222|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:15:01,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1726250231 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1726250231 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1726250231 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1726250231 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1726250231| ~z$r_buff1_thd0~0_In-1726250231) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1726250231|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1726250231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726250231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1726250231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726250231} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1726250231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726250231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1726250231, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1726250231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726250231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:15:01,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In482211297 256) 0))) (or (and .cse0 (= ~z~0_In482211297 |ULTIMATE.start_main_#t~ite70_Out482211297|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite70_Out482211297| ~z$mem_tmp~0_In482211297)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In482211297, ~z$flush_delayed~0=~z$flush_delayed~0_In482211297, ~z~0=~z~0_In482211297} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In482211297, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out482211297|, ~z$flush_delayed~0=~z$flush_delayed~0_In482211297, ~z~0=~z~0_In482211297} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-18 13:15:01,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:15:01,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:15:01 BasicIcfg [2019-12-18 13:15:01,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:15:01,463 INFO L168 Benchmark]: Toolchain (without parser) took 77757.40 ms. Allocated memory was 146.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,463 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.63 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.53 ms. Allocated memory is still 205.0 MB. Free memory was 156.8 MB in the beginning and 153.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,465 INFO L168 Benchmark]: Boogie Preprocessor took 86.90 ms. Allocated memory is still 205.0 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,466 INFO L168 Benchmark]: RCFGBuilder took 1124.81 ms. Allocated memory was 205.0 MB in the beginning and 234.9 MB in the end (delta: 29.9 MB). Free memory was 150.5 MB in the beginning and 200.8 MB in the end (delta: -50.3 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,467 INFO L168 Benchmark]: TraceAbstraction took 75568.78 ms. Allocated memory was 234.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 199.4 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:15:01,470 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.63 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.53 ms. Allocated memory is still 205.0 MB. Free memory was 156.8 MB in the beginning and 153.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.90 ms. Allocated memory is still 205.0 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1124.81 ms. Allocated memory was 205.0 MB in the beginning and 234.9 MB in the end (delta: 29.9 MB). Free memory was 150.5 MB in the beginning and 200.8 MB in the end (delta: -50.3 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75568.78 ms. Allocated memory was 234.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 199.4 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t829, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] FCALL, FORK 0 pthread_create(&t830, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] FCALL, FORK 0 pthread_create(&t831, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t832, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L816] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] EXPR 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 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 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L862] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L862] 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) [L863] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L863] 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)) [L864] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 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)) [L865] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L865] 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)) [L866] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 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)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 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)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3554 SDtfs, 4372 SDslu, 8996 SDs, 0 SdLazy, 3999 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 43 SyntacticMatches, 14 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred 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: 32.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 12221 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 291203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...