/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:56:34,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:56:34,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:56:34,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:56:34,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:56:34,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:56:34,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:56:34,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:56:34,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:56:34,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:56:34,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:56:34,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:56:34,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:56:34,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:56:34,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:56:34,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:56:34,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:56:34,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:56:34,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:56:34,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:56:34,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:56:34,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:56:34,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:56:34,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:56:34,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:56:34,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:56:34,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:56:34,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:56:34,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:56:34,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:56:34,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:56:34,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:56:34,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:56:34,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:56:34,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:56:34,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:56:34,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:56:34,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:56:34,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:56:34,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:56:34,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:56:34,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:56:34,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:56:34,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:56:34,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:56:34,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:56:34,629 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:56:34,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:56:34,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:56:34,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:56:34,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:56:34,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:56:34,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:56:34,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:56:34,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:56:34,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:56:34,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:56:34,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:56:34,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:56:34,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:56:34,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:56:34,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:56:34,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:56:34,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:34,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:56:34,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:56:34,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:56:34,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:56:34,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:56:34,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:56:34,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:56:34,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:56:34,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:56:34,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:56:34,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:56:34,963 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:56:34,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-27 02:56:35,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d076ae/3f4849ecc3c546fcbc80a5a98355ab44/FLAG6fb5d089d [2019-12-27 02:56:35,613 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:56:35,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-27 02:56:35,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d076ae/3f4849ecc3c546fcbc80a5a98355ab44/FLAG6fb5d089d [2019-12-27 02:56:35,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d076ae/3f4849ecc3c546fcbc80a5a98355ab44 [2019-12-27 02:56:35,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:56:35,876 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:56:35,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:35,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:56:35,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:56:35,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:35" (1/1) ... [2019-12-27 02:56:35,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2250643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:35, skipping insertion in model container [2019-12-27 02:56:35,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:35" (1/1) ... [2019-12-27 02:56:35,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:56:35,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:56:36,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:36,481 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:56:36,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:36,683 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:56:36,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36 WrapperNode [2019-12-27 02:56:36,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:36,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:36,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:56:36,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:56:36,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:36,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:56:36,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:56:36,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:56:36,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... [2019-12-27 02:56:36,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:56:36,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:56:36,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:56:36,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:56:36,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:56:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:56:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:56:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:56:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:56:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:56:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:56:36,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:56:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:56:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:56:36,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:56:36,860 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:56:37,639 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:56:37,639 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:56:37,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:37 BoogieIcfgContainer [2019-12-27 02:56:37,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:56:37,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:56:37,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:56:37,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:56:37,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:56:35" (1/3) ... [2019-12-27 02:56:37,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d6784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:37, skipping insertion in model container [2019-12-27 02:56:37,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:36" (2/3) ... [2019-12-27 02:56:37,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d6784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:37, skipping insertion in model container [2019-12-27 02:56:37,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:37" (3/3) ... [2019-12-27 02:56:37,650 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-12-27 02:56:37,661 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:56:37,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:56:37,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:56:37,671 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:56:37,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,780 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:37,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:56:37,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:56:37,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:56:37,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:56:37,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:56:37,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:56:37,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:56:37,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:56:37,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:56:37,846 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 02:56:37,848 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:37,983 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:37,984 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:38,000 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:38,017 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:38,081 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:38,081 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:38,089 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:38,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:56:38,107 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:56:42,965 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 02:56:43,114 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 02:56:43,442 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-27 02:56:43,442 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 02:56:43,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-27 02:56:44,021 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-27 02:56:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-27 02:56:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:56:44,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:44,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:56:44,032 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-27 02:56:44,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:44,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357859519] [2019-12-27 02:56:44,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:44,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357859519] [2019-12-27 02:56:44,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:44,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:56:44,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545359975] [2019-12-27 02:56:44,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:44,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:44,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:44,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:44,330 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-27 02:56:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:44,600 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-27 02:56:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:44,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:56:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:44,748 INFO L225 Difference]: With dead ends: 8460 [2019-12-27 02:56:44,748 INFO L226 Difference]: Without dead ends: 7472 [2019-12-27 02:56:44,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-27 02:56:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-27 02:56:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-27 02:56:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-27 02:56:45,123 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-27 02:56:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:45,123 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-27 02:56:45,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-27 02:56:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:56:45,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:45,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:45,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-27 02:56:45,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:45,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29476457] [2019-12-27 02:56:45,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:45,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29476457] [2019-12-27 02:56:45,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:45,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:45,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062887040] [2019-12-27 02:56:45,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:56:45,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:56:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:56:45,233 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-27 02:56:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:45,667 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-27 02:56:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:56:45,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:56:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:45,749 INFO L225 Difference]: With dead ends: 11704 [2019-12-27 02:56:45,749 INFO L226 Difference]: Without dead ends: 11690 [2019-12-27 02:56:45,750 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-27 02:56:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-27 02:56:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-27 02:56:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-27 02:56:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-27 02:56:46,166 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-27 02:56:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:46,167 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-27 02:56:46,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:56:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-27 02:56:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:56:46,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:46,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:46,172 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-27 02:56:46,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:46,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077147596] [2019-12-27 02:56:46,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:46,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077147596] [2019-12-27 02:56:46,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:46,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:56:46,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503613754] [2019-12-27 02:56:46,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:56:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:56:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:46,298 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-27 02:56:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:46,692 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-27 02:56:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:56:46,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 02:56:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:46,753 INFO L225 Difference]: With dead ends: 15000 [2019-12-27 02:56:46,753 INFO L226 Difference]: Without dead ends: 15000 [2019-12-27 02:56:46,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:56:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-27 02:56:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-27 02:56:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-27 02:56:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-27 02:56:47,787 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-27 02:56:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:47,788 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-27 02:56:47,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:56:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-27 02:56:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:56:47,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:47,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:47,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:47,793 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-27 02:56:47,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:47,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858206618] [2019-12-27 02:56:47,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:47,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858206618] [2019-12-27 02:56:47,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:47,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:56:47,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870707765] [2019-12-27 02:56:47,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:47,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:47,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:47,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:47,878 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-27 02:56:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:47,957 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-27 02:56:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:47,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:56:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:48,015 INFO L225 Difference]: With dead ends: 11883 [2019-12-27 02:56:48,016 INFO L226 Difference]: Without dead ends: 11883 [2019-12-27 02:56:48,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-27 02:56:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-27 02:56:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-27 02:56:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-27 02:56:48,455 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-27 02:56:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:48,456 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-27 02:56:48,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-27 02:56:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:56:48,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:48,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:48,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-27 02:56:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345843819] [2019-12-27 02:56:48,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:48,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345843819] [2019-12-27 02:56:48,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:48,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:48,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971892361] [2019-12-27 02:56:48,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:48,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:48,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:48,502 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-27 02:56:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:48,584 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-27 02:56:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:48,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 02:56:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:48,623 INFO L225 Difference]: With dead ends: 19949 [2019-12-27 02:56:48,623 INFO L226 Difference]: Without dead ends: 11074 [2019-12-27 02:56:48,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-27 02:56:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-27 02:56:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-27 02:56:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-27 02:56:48,930 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-27 02:56:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:48,931 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-27 02:56:48,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-27 02:56:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:56:48,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:48,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:48,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-27 02:56:48,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:48,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194648299] [2019-12-27 02:56:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:49,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194648299] [2019-12-27 02:56:49,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:49,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:56:49,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310961825] [2019-12-27 02:56:49,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:56:49,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:56:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:56:49,022 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 4 states. [2019-12-27 02:56:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:49,061 INFO L93 Difference]: Finished difference Result 1761 states and 4355 transitions. [2019-12-27 02:56:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:56:49,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 02:56:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:49,064 INFO L225 Difference]: With dead ends: 1761 [2019-12-27 02:56:49,064 INFO L226 Difference]: Without dead ends: 1251 [2019-12-27 02:56:49,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-27 02:56:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1247. [2019-12-27 02:56:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-27 02:56:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2756 transitions. [2019-12-27 02:56:49,087 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2756 transitions. Word has length 17 [2019-12-27 02:56:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:49,087 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2756 transitions. [2019-12-27 02:56:49,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:56:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2756 transitions. [2019-12-27 02:56:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:56:49,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:49,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:49,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-27 02:56:49,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:49,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734444207] [2019-12-27 02:56:49,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:49,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734444207] [2019-12-27 02:56:49,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:49,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:56:49,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28386760] [2019-12-27 02:56:49,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:56:49,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:56:49,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:56:49,171 INFO L87 Difference]: Start difference. First operand 1247 states and 2756 transitions. Second operand 6 states. [2019-12-27 02:56:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:49,456 INFO L93 Difference]: Finished difference Result 1303 states and 2824 transitions. [2019-12-27 02:56:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:56:49,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 02:56:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:49,460 INFO L225 Difference]: With dead ends: 1303 [2019-12-27 02:56:49,460 INFO L226 Difference]: Without dead ends: 1252 [2019-12-27 02:56:49,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:56:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-27 02:56:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1205. [2019-12-27 02:56:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-12-27 02:56:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2651 transitions. [2019-12-27 02:56:49,483 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2651 transitions. Word has length 25 [2019-12-27 02:56:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:49,483 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 2651 transitions. [2019-12-27 02:56:49,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:56:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2651 transitions. [2019-12-27 02:56:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:56:49,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:49,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:49,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1020603025, now seen corresponding path program 1 times [2019-12-27 02:56:49,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:49,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362720405] [2019-12-27 02:56:49,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:49,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362720405] [2019-12-27 02:56:49,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:49,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:56:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276543296] [2019-12-27 02:56:49,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:56:49,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:56:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:49,594 INFO L87 Difference]: Start difference. First operand 1205 states and 2651 transitions. Second operand 5 states. [2019-12-27 02:56:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:50,049 INFO L93 Difference]: Finished difference Result 1876 states and 4050 transitions. [2019-12-27 02:56:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:56:50,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:56:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:50,053 INFO L225 Difference]: With dead ends: 1876 [2019-12-27 02:56:50,053 INFO L226 Difference]: Without dead ends: 1876 [2019-12-27 02:56:50,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 02:56:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-12-27 02:56:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1694. [2019-12-27 02:56:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2019-12-27 02:56:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 3700 transitions. [2019-12-27 02:56:50,086 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 3700 transitions. Word has length 27 [2019-12-27 02:56:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:50,087 INFO L462 AbstractCegarLoop]: Abstraction has 1694 states and 3700 transitions. [2019-12-27 02:56:50,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:56:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3700 transitions. [2019-12-27 02:56:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:56:50,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:50,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:50,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-27 02:56:50,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:50,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949753019] [2019-12-27 02:56:50,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:50,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949753019] [2019-12-27 02:56:50,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:50,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:56:50,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763692805] [2019-12-27 02:56:50,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:56:50,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:56:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:50,213 INFO L87 Difference]: Start difference. First operand 1694 states and 3700 transitions. Second operand 5 states. [2019-12-27 02:56:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:50,264 INFO L93 Difference]: Finished difference Result 1036 states and 2147 transitions. [2019-12-27 02:56:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:56:50,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:56:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:50,266 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 02:56:50,267 INFO L226 Difference]: Without dead ends: 844 [2019-12-27 02:56:50,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:56:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-12-27 02:56:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 808. [2019-12-27 02:56:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 02:56:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1730 transitions. [2019-12-27 02:56:50,281 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1730 transitions. Word has length 28 [2019-12-27 02:56:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:50,282 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1730 transitions. [2019-12-27 02:56:50,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:56:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1730 transitions. [2019-12-27 02:56:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:56:50,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:50,285 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] [2019-12-27 02:56:50,285 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1996003398, now seen corresponding path program 1 times [2019-12-27 02:56:50,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:50,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636215556] [2019-12-27 02:56:50,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:50,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636215556] [2019-12-27 02:56:50,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:50,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:56:50,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351031771] [2019-12-27 02:56:50,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:50,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:50,328 INFO L87 Difference]: Start difference. First operand 808 states and 1730 transitions. Second operand 3 states. [2019-12-27 02:56:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:50,379 INFO L93 Difference]: Finished difference Result 1209 states and 2521 transitions. [2019-12-27 02:56:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:50,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:56:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:50,381 INFO L225 Difference]: With dead ends: 1209 [2019-12-27 02:56:50,382 INFO L226 Difference]: Without dead ends: 1209 [2019-12-27 02:56:50,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-12-27 02:56:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 887. [2019-12-27 02:56:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-27 02:56:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1887 transitions. [2019-12-27 02:56:50,400 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1887 transitions. Word has length 51 [2019-12-27 02:56:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:50,400 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1887 transitions. [2019-12-27 02:56:50,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1887 transitions. [2019-12-27 02:56:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:56:50,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:50,403 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] [2019-12-27 02:56:50,403 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash -141325406, now seen corresponding path program 1 times [2019-12-27 02:56:50,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:50,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94899891] [2019-12-27 02:56:50,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:50,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94899891] [2019-12-27 02:56:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:50,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:56:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753274604] [2019-12-27 02:56:50,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:56:50,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:56:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:56:50,499 INFO L87 Difference]: Start difference. First operand 887 states and 1887 transitions. Second operand 7 states. [2019-12-27 02:56:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:50,697 INFO L93 Difference]: Finished difference Result 1513 states and 3141 transitions. [2019-12-27 02:56:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:56:50,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 02:56:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:50,699 INFO L225 Difference]: With dead ends: 1513 [2019-12-27 02:56:50,699 INFO L226 Difference]: Without dead ends: 1013 [2019-12-27 02:56:50,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:56:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-27 02:56:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 884. [2019-12-27 02:56:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-27 02:56:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1862 transitions. [2019-12-27 02:56:50,713 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1862 transitions. Word has length 51 [2019-12-27 02:56:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:50,714 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1862 transitions. [2019-12-27 02:56:50,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:56:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1862 transitions. [2019-12-27 02:56:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:56:50,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:50,716 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] [2019-12-27 02:56:50,717 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash 747364532, now seen corresponding path program 2 times [2019-12-27 02:56:50,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:50,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913511504] [2019-12-27 02:56:50,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:50,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913511504] [2019-12-27 02:56:50,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:50,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:50,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952040297] [2019-12-27 02:56:50,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:50,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:50,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:50,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:50,818 INFO L87 Difference]: Start difference. First operand 884 states and 1862 transitions. Second operand 3 states. [2019-12-27 02:56:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:50,868 INFO L93 Difference]: Finished difference Result 1119 states and 2343 transitions. [2019-12-27 02:56:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:50,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:56:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:50,870 INFO L225 Difference]: With dead ends: 1119 [2019-12-27 02:56:50,871 INFO L226 Difference]: Without dead ends: 1119 [2019-12-27 02:56:50,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-12-27 02:56:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 897. [2019-12-27 02:56:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-12-27 02:56:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1904 transitions. [2019-12-27 02:56:50,886 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1904 transitions. Word has length 51 [2019-12-27 02:56:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:50,887 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1904 transitions. [2019-12-27 02:56:50,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1904 transitions. [2019-12-27 02:56:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:50,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:50,890 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] [2019-12-27 02:56:50,890 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 559077404, now seen corresponding path program 1 times [2019-12-27 02:56:50,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:50,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426401378] [2019-12-27 02:56:50,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:51,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426401378] [2019-12-27 02:56:51,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:51,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:56:51,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217989702] [2019-12-27 02:56:51,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:56:51,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:56:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:56:51,052 INFO L87 Difference]: Start difference. First operand 897 states and 1904 transitions. Second operand 9 states. [2019-12-27 02:56:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:51,935 INFO L93 Difference]: Finished difference Result 1366 states and 2785 transitions. [2019-12-27 02:56:51,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:56:51,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 02:56:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:51,938 INFO L225 Difference]: With dead ends: 1366 [2019-12-27 02:56:51,939 INFO L226 Difference]: Without dead ends: 1366 [2019-12-27 02:56:51,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:56:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-27 02:56:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 999. [2019-12-27 02:56:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 02:56:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2097 transitions. [2019-12-27 02:56:51,956 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2097 transitions. Word has length 52 [2019-12-27 02:56:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:51,957 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2097 transitions. [2019-12-27 02:56:51,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:56:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2097 transitions. [2019-12-27 02:56:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:51,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:51,960 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] [2019-12-27 02:56:51,960 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash -834145858, now seen corresponding path program 2 times [2019-12-27 02:56:51,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:51,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412829917] [2019-12-27 02:56:51,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:52,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412829917] [2019-12-27 02:56:52,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:52,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:52,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125251873] [2019-12-27 02:56:52,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:52,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:52,030 INFO L87 Difference]: Start difference. First operand 999 states and 2097 transitions. Second operand 3 states. [2019-12-27 02:56:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:52,042 INFO L93 Difference]: Finished difference Result 999 states and 2096 transitions. [2019-12-27 02:56:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:52,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:56:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:52,044 INFO L225 Difference]: With dead ends: 999 [2019-12-27 02:56:52,044 INFO L226 Difference]: Without dead ends: 999 [2019-12-27 02:56:52,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-27 02:56:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 803. [2019-12-27 02:56:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-27 02:56:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1726 transitions. [2019-12-27 02:56:52,059 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1726 transitions. Word has length 52 [2019-12-27 02:56:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:52,059 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1726 transitions. [2019-12-27 02:56:52,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1726 transitions. [2019-12-27 02:56:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:56:52,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:52,062 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] [2019-12-27 02:56:52,062 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-27 02:56:52,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225997339] [2019-12-27 02:56:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:56:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:56:52,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:56:52,224 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:56:52,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_35|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1443~0.base_35| 4)) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= (store .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_35| 1) |v_#valid_57|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1443~0.base_35|) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1443~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1443~0.base_35|) |v_ULTIMATE.start_main_~#t1443~0.offset_27| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484) (= |v_ULTIMATE.start_main_~#t1443~0.offset_27| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ULTIMATE.start_main_~#t1443~0.offset=|v_ULTIMATE.start_main_~#t1443~0.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_~#t1443~0.base=|v_ULTIMATE.start_main_~#t1443~0.base_35|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t1444~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1443~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1444~0.base, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1443~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:56:52,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd0~0_In-591727192 ~y$r_buff1_thd0~0_Out-591727192) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591727192)) (= ~y$r_buff1_thd2~0_Out-591727192 ~y$r_buff0_thd2~0_In-591727192) (= 1 ~y$r_buff0_thd1~0_Out-591727192) (= ~y$r_buff1_thd1~0_Out-591727192 ~y$r_buff0_thd1~0_In-591727192) (= 1 ~x~0_Out-591727192)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591727192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591727192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591727192, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591727192} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-591727192, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-591727192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591727192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-591727192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591727192, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591727192, ~x~0=~x~0_Out-591727192, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-591727192} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:56:52,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t1444~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1444~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) |v_ULTIMATE.start_main_~#t1444~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1444~0.offset, #length, ULTIMATE.start_main_~#t1444~0.base] because there is no mapped edge [2019-12-27 02:56:52,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In84219729 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In84219729 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out84219729|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In84219729 |P0Thread1of1ForFork0_#t~ite5_Out84219729|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In84219729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In84219729} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out84219729|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84219729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In84219729} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:56:52,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1485138400 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1485138400| ~y$w_buff0~0_In1485138400) (= |P1Thread1of1ForFork1_#t~ite14_In1485138400| |P1Thread1of1ForFork1_#t~ite14_Out1485138400|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1485138400 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1485138400 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1485138400 256)) (and (= (mod ~y$w_buff1_used~0_In1485138400 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1485138400| ~y$w_buff0~0_In1485138400) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1485138400| |P1Thread1of1ForFork1_#t~ite15_Out1485138400|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1485138400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1485138400, ~y$w_buff0~0=~y$w_buff0~0_In1485138400, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1485138400, ~weak$$choice2~0=~weak$$choice2~0_In1485138400, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1485138400|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1485138400} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1485138400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1485138400, ~y$w_buff0~0=~y$w_buff0~0_In1485138400, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1485138400, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1485138400|, ~weak$$choice2~0=~weak$$choice2~0_In1485138400, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1485138400|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1485138400} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:56:52,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1248951138 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1248951138 |P1Thread1of1ForFork1_#t~ite21_Out-1248951138|) (= |P1Thread1of1ForFork1_#t~ite20_In-1248951138| |P1Thread1of1ForFork1_#t~ite20_Out-1248951138|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1248951138 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1248951138 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1248951138 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1248951138 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1248951138| |P1Thread1of1ForFork1_#t~ite20_Out-1248951138|) .cse0 (= ~y$w_buff0_used~0_In-1248951138 |P1Thread1of1ForFork1_#t~ite20_Out-1248951138|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1248951138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1248951138, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1248951138|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1248951138, ~weak$$choice2~0=~weak$$choice2~0_In-1248951138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1248951138} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1248951138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1248951138, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1248951138|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1248951138, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1248951138|, ~weak$$choice2~0=~weak$$choice2~0_In-1248951138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1248951138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:56:52,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 02:56:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1450320905 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1450320905 |P1Thread1of1ForFork1_#t~ite30_Out-1450320905|) (= |P1Thread1of1ForFork1_#t~ite29_In-1450320905| |P1Thread1of1ForFork1_#t~ite29_Out-1450320905|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1450320905 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1450320905 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-1450320905 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1450320905 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1450320905| |P1Thread1of1ForFork1_#t~ite30_Out-1450320905|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1450320905| ~y$r_buff1_thd2~0_In-1450320905)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1450320905, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1450320905|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450320905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450320905, ~weak$$choice2~0=~weak$$choice2~0_In-1450320905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450320905} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1450320905, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1450320905|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1450320905|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450320905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450320905, ~weak$$choice2~0=~weak$$choice2~0_In-1450320905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450320905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:56:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 02:56:52,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In749442699 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In749442699 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out749442699| |P1Thread1of1ForFork1_#t~ite32_Out749442699|))) (or (and (= ~y$w_buff1~0_In749442699 |P1Thread1of1ForFork1_#t~ite32_Out749442699|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= ~y~0_In749442699 |P1Thread1of1ForFork1_#t~ite32_Out749442699|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In749442699, ~y$w_buff1~0=~y$w_buff1~0_In749442699, ~y~0=~y~0_In749442699, ~y$w_buff1_used~0=~y$w_buff1_used~0_In749442699} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In749442699, ~y$w_buff1~0=~y$w_buff1~0_In749442699, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out749442699|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out749442699|, ~y~0=~y~0_In749442699, ~y$w_buff1_used~0=~y$w_buff1_used~0_In749442699} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:56:52,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1703100255 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1703100255 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1703100255 |P1Thread1of1ForFork1_#t~ite34_Out-1703100255|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1703100255|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703100255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703100255} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703100255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703100255, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1703100255|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:56:52,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In1216824084 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1216824084 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1216824084 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1216824084 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1216824084 |P1Thread1of1ForFork1_#t~ite35_Out1216824084|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1216824084|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1216824084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1216824084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1216824084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1216824084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1216824084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1216824084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1216824084, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1216824084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1216824084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:56:52,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1077027847 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1077027847 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1077027847| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1077027847| ~y$r_buff0_thd2~0_In-1077027847) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1077027847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1077027847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1077027847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1077027847, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1077027847|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:56:52,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In185459277 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In185459277 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In185459277 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In185459277 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out185459277| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In185459277 |P1Thread1of1ForFork1_#t~ite37_Out185459277|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In185459277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In185459277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In185459277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185459277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In185459277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In185459277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In185459277, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out185459277|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185459277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:56:52,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:56:52,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1533563984 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In1533563984 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1533563984 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1533563984 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1533563984 |P0Thread1of1ForFork0_#t~ite6_Out1533563984|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1533563984|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1533563984, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533563984, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1533563984, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533563984} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1533563984|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1533563984, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533563984, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1533563984, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533563984} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:56:52,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-66796396 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-66796396 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-66796396 ~y$r_buff0_thd1~0_In-66796396)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out-66796396 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-66796396, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-66796396} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-66796396, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-66796396|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-66796396} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:56:52,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1790735585 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1790735585 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1790735585 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1790735585 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1790735585| ~y$r_buff1_thd1~0_In1790735585) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1790735585| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1790735585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790735585, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1790735585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790735585} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1790735585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790735585, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1790735585|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1790735585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790735585} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:56:52,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:56:52,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:56:52,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite40_Out846325424| |ULTIMATE.start_main_#t~ite41_Out846325424|)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In846325424 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In846325424 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out846325424| ~y$w_buff1~0_In846325424)) (and (= |ULTIMATE.start_main_#t~ite40_Out846325424| ~y~0_In846325424) .cse2 (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In846325424, ~y~0=~y~0_In846325424, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In846325424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846325424} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out846325424|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out846325424|, ~y$w_buff1~0=~y$w_buff1~0_In846325424, ~y~0=~y~0_In846325424, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In846325424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846325424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:56:52,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2138870699 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2138870699 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2138870699 |ULTIMATE.start_main_#t~ite42_Out-2138870699|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-2138870699|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138870699, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2138870699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138870699, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2138870699, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2138870699|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:56:52,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In946981478 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In946981478 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In946981478 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In946981478 256)))) (or (and (= ~y$w_buff1_used~0_In946981478 |ULTIMATE.start_main_#t~ite43_Out946981478|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out946981478| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In946981478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946981478, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In946981478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946981478} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In946981478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946981478, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out946981478|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In946981478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946981478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:56:52,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-559291020 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-559291020 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-559291020 |ULTIMATE.start_main_#t~ite44_Out-559291020|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-559291020|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-559291020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-559291020} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-559291020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-559291020, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-559291020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:56:52,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1227540184 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1227540184 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1227540184 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1227540184 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1227540184| ~y$r_buff1_thd0~0_In-1227540184) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1227540184| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1227540184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1227540184, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1227540184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1227540184} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1227540184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1227540184, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1227540184, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1227540184|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1227540184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:56:52,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:56:52,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:56:52 BasicIcfg [2019-12-27 02:56:52,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:56:52,354 INFO L168 Benchmark]: Toolchain (without parser) took 16478.29 ms. Allocated memory was 145.2 MB in the beginning and 702.5 MB in the end (delta: 557.3 MB). Free memory was 101.6 MB in the beginning and 446.6 MB in the end (delta: -345.0 MB). Peak memory consumption was 212.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,355 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.00 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.03 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,357 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,358 INFO L168 Benchmark]: RCFGBuilder took 852.18 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 107.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,359 INFO L168 Benchmark]: TraceAbstraction took 14709.72 ms. Allocated memory was 201.9 MB in the beginning and 702.5 MB in the end (delta: 500.7 MB). Free memory was 107.2 MB in the beginning and 446.6 MB in the end (delta: -339.4 MB). Peak memory consumption was 161.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:56:52,363 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.00 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.03 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.18 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 107.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14709.72 ms. Allocated memory was 201.9 MB in the beginning and 702.5 MB in the end (delta: 500.7 MB). Free memory was 107.2 MB in the beginning and 446.6 MB in the end (delta: -339.4 MB). Peak memory consumption was 161.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1622 SDtfs, 1512 SDslu, 3041 SDs, 0 SdLazy, 1794 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 6504 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 45728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...